Sciweavers

19130 search results - page 102 / 3826
» Modelling multi-path problems
Sort
View
ANOR
2002
99views more  ANOR 2002»
15 years 6 months ago
A General Approach to the Physician Rostering Problem
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
Louis-Martin Rousseau, Gilles Pesant, Michel Gendr...
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 8 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
CSO
2009
IEEE
16 years 1 months ago
Competitive Analysis of Online Price Discount Replacement Problem
When a paid price discount activity occurs, the decisionmaker must decide whether or not and when to pay the additional fees for preferential price in an online fashion. This prob...
Lili Ding, Xinmin Liu, Wanglin Kang
ICTAI
2007
IEEE
16 years 19 days ago
Swarm Approaches for the Patrolling Problem, Information Propagation vs. Pheromone Evaporation
This paper deals with the multi-agent patrolling problem in unknown environment using two collective approaches exploiting environmental dynamics. After specifying criteria of per...
Hoang Nam Chu, Arnaud Glad, Olivier Simonin, Fran&...
CP
2005
Springer
15 years 12 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter