Sciweavers

551 search results - page 77 / 111
» Continuous Search in Constraint Programming
Sort
View
CP
2009
Springer
14 years 2 months ago
Closing the Open Shop: Contradicting Conventional Wisdom
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
Diarmuid Grimes, Emmanuel Hebrard, Arnaud Malapert
ISCAS
2006
IEEE
102views Hardware» more  ISCAS 2006»
14 years 1 months ago
A low power merge cell processor for real-time spike sorting in implantable neural prostheses
Extremely low power consumption is the critical constraint for designing implantable neural decoders that inter- Desired face directly with the nervous system. Typically a system w...
M. D. Linderman, T. H. Meng
CP
2006
Springer
13 years 11 months ago
Differentiable Invariants
Abstract. Invariants that incrementally maintain the value of expresder assignments to their variables are a natural abstraction to build high-level local search algorithms. But th...
Pascal Van Hentenryck, Laurent Michel
CP
2009
Springer
14 years 8 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
ASPLOS
2012
ACM
12 years 3 months ago
Clearing the clouds: a study of emerging scale-out workloads on modern hardware
Emerging scale-out workloads require extensive amounts of computational resources. However, data centers using modern server hardware face physical constraints in space and power,...
Michael Ferdman, Almutaz Adileh, Yusuf Onur Ko&cce...