Sciweavers

12597 search results - page 2211 / 2520
» Complexity of Mechanism Design
Sort
View
282
Voted
CPAIOR
2010
Springer
15 years 5 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
DAC
2010
ACM
15 years 5 months ago
MFTI: matrix-format tangential interpolation for modeling multi-port systems
Numerous algorithms to macromodel a linear time-invariant (LTI) system from its frequency-domain sampling data have been proposed in recent years [1, 2, 3, 4, 5, 6, 7, 8], among w...
Yuanzhe Wang, Chi-Un Lei, Grantham K. H. Pang, Nga...
209
Voted
DAS
2010
Springer
15 years 5 months ago
Information extraction by finding repeated structure
Repetition of layout structure is prevalent in document images. In document design, such repetition conveys the underlying logical and functional structure of the data. For exampl...
Evgeniy Bart, Prateek Sarkar
DLOG
2010
15 years 5 months ago
Checking Full Satisfiability of Conceptual Models
Abstract. UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constr...
Alessandro Artale, Diego Calvanese, Yazmin Ang&eac...
226
Voted
ER
2010
Springer
132views Database» more  ER 2010»
15 years 5 months ago
Full Satisfiability of UML Class Diagrams
UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constraints expr...
Alessandro Artale, Diego Calvanese, Yazmin Ang&eac...
« Prev « First page 2211 / 2520 Last » Next »