Sciweavers

1151 search results - page 56 / 231
» Modelling Digital Circuits Problems with Set Constraints
Sort
View
CP
2003
Springer
14 years 2 months ago
Open Constraint Optimization
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
Boi Faltings, Santiago Macho-Gonzalez
SPLC
2008
13 years 10 months ago
Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
Jules White, B. Doughtery, Douglas C. Schmidt
PAMI
2002
149views more  PAMI 2002»
13 years 8 months ago
Region Tracking via Level Set PDEs without Motion Computation
Tracking regions in an image sequence is a challenging and di cult problem in image processing and computer vision, and at the same time, one that has many important applications:...
Abdol-Reza Mansouri
CSCLP
2007
Springer
14 years 3 months ago
Generalizing Global Constraints Based on Network Flows
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
Igor Razgon, Barry O'Sullivan, Gregory M. Provan
ISPD
1999
ACM
79views Hardware» more  ISPD 1999»
14 years 1 months ago
Partitioning with terminals: a "new" problem and new benchmarks
The presence of fixed terminals in hypergraph partitioning instances arising in top-down standard-cell placement makes such instances qualitatively different from the free hyperg...
Charles J. Alpert, Andrew E. Caldwell, Andrew B. K...