Sciweavers

348 search results - page 9 / 70
» Using Constraint Networks on Timelines to Model and Solve Pl...
Sort
View
AAAI
1997
13 years 8 months ago
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
Roberto J. Bayardo Jr., Robert Schrag
WSC
2004
13 years 8 months ago
Solving Stochastic Mathematical Programs with Complementarity Constraints Using Simulation
Recently, simulation-based methods have been successfully used for solving challenging stochastic optimization problems and equilibrium models. Here we report some of the recent p...
S. Ilker Birbil, Gül Gürkan, Ovidiu List...
ICPP
1998
IEEE
13 years 11 months ago
Parallel Algorithms for Airline Crew Planning on Networks of Workstations
The crew planning problem has been successfully solved on a loosely connected network of workstations (NOW) using advanced computational techniques and efficient communication pat...
Christos Goumopoulos, Panayiotis Alefragis, Efthym...
SOICT
2010
13 years 2 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
ASIAMS
2007
IEEE
14 years 1 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham