5180 search results - page 141 / 1036 » Concurrency, Time, and Constraints |
175
click to vote
ACL
2012
13 years 9 months ago
2012
Temporal reasoners for document understanding typically assume that a document’s creation date is known. Algorithms to ground relative time expressions and order events often re...
177
click to vote
JSSPP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Buffered coscheduling is a new methodology that can substantially increase resource utilization, improve response time, and simplify the development of the run-time suppo...
182
click to vote
NETWORKS
2007
15 years 6 months ago
2007
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
142
click to vote
IFM
2005
Springer
16 years 9 hour ago
2005
Springer
We provide an automatic method for calculating the path condition for programs with real time constraints. This method can be used for the semiautomatic verification of a unit of ...
149
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...