703 search results - page 123 / 141 » Maintenance scheduling problems as benchmarks for constraint... |
ATAL
2003
Springer
14 years 1 months ago
2003
Springer
Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. In domains where agents have varying degrees of interaction and ...
RSP
1998
IEEE
14 years 21 days ago
1998
IEEE
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
A good distance metric is crucial for unsupervised learning from high-dimensional data. To learn a metric without any constraint or class label information, most unsupervised metr...
DATE
1999
IEEE
14 years 23 days ago
1999
IEEE
In this paper, we present a system synthesis algorithm, called MOCSYN, which partitions and schedules embedded system specifications to intellectual property cores in an integrate...
C3S2E
2010
ACM
13 years 9 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...