663 search results - page 44 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
73
Voted
ICSE
2009
IEEE-ACM
15 years 4 months ago
2009
IEEE-ACM
Minimizing the computing infrastructure (such as processors) in a distributed real-time embedded (DRE) system deployment helps reduce system size, weight, power consumption, and c...
CP
2011
Springer
13 years 9 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
DBPL
2005
Springer
2005
Springer
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
15 years 3 months ago
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
DEDS
2010
14 years 7 months ago
2010
We consider Discrete Event Systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task mee...
68
Voted
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
We present an evolutionary methodology that explores the evolution of network topology when a uniform growth of the network traffic is considered. The network redesign problem is ...