Sciweavers

93 search results - page 13 / 19
» Constraint Programming Models for Graceful Graphs
Sort
View
ECBS
1999
IEEE
171views Hardware» more  ECBS 1999»
13 years 11 months ago
Metamodeling - Rapid Design and Evolution of Domain-Specific Modeling Environments
Model integrated computing (MIC) is gaining increased attention as an effective and efficient method for developing, maintaining, and evolving large-scale, domain-specific softwar...
Greg Nordstrom, Janos Sztipanovits, Gabor Karsai, ...
CPAIOR
2010
Springer
13 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
CP
2003
Springer
14 years 19 days ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 7 months ago
Sensor Networks with Random Links: Topology Design for Distributed Consensus
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
Soummya Kar, José M. F. Moura
SIGSOFT
2008
ACM
14 years 8 months ago
Effective blame for information-flow violations
Programs trusted with secure information should not release that information in ways contrary to system policy. However, when a program contains an illegal flow of information, cu...
Dave King 0002, Trent Jaeger, Somesh Jha, Sanjit A...