100 search results - page 6 / 20 » New complexity results for time-constrained dynamical optima... |
CAV
2001
Springer
15 years 4 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
EAAI
2007
14 years 11 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
105
click to vote
MOBICOM
2003
ACM
15 years 4 months ago
2003
ACM
We develop algorithms for ļ¬nding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
DATE
2009
IEEE
15 years 6 months ago
2009
IEEE
āWe propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a speciļ¬ed execution path in a program. In or...
115
click to vote
IJCAI
2001
15 years 29 days ago
2001
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...