Sciweavers

567 search results - page 20 / 114
» Exact train pathing
Sort
View
BIRTHDAY
2009
Springer
15 years 6 months ago
On Lazy Commutation
Abstract. We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating wellfoundedness of unions of relations. To that en...
Nachum Dershowitz
COLING
2008
15 years 1 months ago
ILP-based Conceptual Analysis for Chinese NPs
In this paper, we explore a conceptual resource for Chinese nominal phrases, which allows multi-dependency and distinction between dependency and the corresponding exact relation....
Paul D. Ji, Stephen G. Pulman
CP
2008
Springer
15 years 1 months ago
Approximate Compilation of Constraints into Multivalued Decision Diagrams
We present an incremental refinement algorithm for approximate compilation of constraint satisfaction models into multivalued decision diagrams (MDDs). The algorithm uses a vertex ...
Tarik Hadzic, John N. Hooker, Barry O'Sullivan, Pe...
ATMOS
2010
163views Optimization» more  ATMOS 2010»
14 years 10 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...
IFM
2005
Springer
15 years 5 months ago
Generating Path Conditions for Timed Systems
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 ...
Saddek Bensalem, Doron Peled, Hongyang Qu, Stavros...