838 search results - page 69 / 168 » Finding Optimal Solutions to Atomix |
IJCAI
1989
15 years 1 months ago
1989
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
118
click to vote
SIGOPS
2010
14 years 6 months ago
2010
Finding an efficient configuration for cluster-based multi-tier Internet services is often a difficult task. Moreover, even a good configuration could become obsolete, depending o...
ISPD
2003
ACM
15 years 5 months ago
2003
ACM
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
EH
2004
IEEE
15 years 3 months ago
2004
IEEE
Intrinsic evolution is often limited to using standard electronic components as the media for problem solving. It has been argued that because such components are human designed a...
AIPS
2006
15 years 1 months ago
2006
Many scheduling problems are posed as optimization problems where the goal is to find a feasible schedule that maximizes the utilization of some resource. In some domains it is al...