Sciweavers

972 search results - page 178 / 195
» Reasoning with Conditional Time-Intervals
Sort
View
AMAI
2004
Springer
14 years 1 months ago
Warped Landscapes and Random Acts of SAT Solving
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
Dave A. D. Tompkins, Holger H. Hoos
ILP
2004
Springer
14 years 29 days ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...
MDM
2004
Springer
14 years 29 days ago
Middleware Providing Dynamic Group Communication Facility for Cellular Phone Applications
In this paper, we propose a middleware library for efficiently developing distributed cooperative applications consisting of a large number of cellular phones with Java executors....
Kouji Nishigaki, Keiichi Yasumoto, Takaaki Umedu, ...
OOPSLA
2004
Springer
14 years 29 days ago
Practical predicate dispatch
Predicate dispatch is an object-oriented (OO) language mechanism for determining the method implementation to be invoked upon a message send. With predicate dispatch, each method ...
Todd D. Millstein
SPAA
2003
ACM
14 years 25 days ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman