250 search results - page 37 / 50 » The complexity of temporal constraint satisfaction problems |
JSS
2011
13 years 3 months ago
2011
Due to the complex nature of scientific workflow environments, temporal violations often take place and may severely reduce the timeliness of the execution’s results. To handle ...
ASPDAC
2004
ACM
14 years 2 months ago
2004
ACM
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
TIME
1994
IEEE
14 years 21 days ago
1994
IEEE
We are concerned with temporalreasoning problems where there is uncertainty about the order in which events occur. The task of temporal reasoning is to derive an event sequence co...
CP
1998
Springer
14 years 24 days ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...