Sciweavers

13376 search results - page 202 / 2676
» Problem Solving with
Sort
View
111
Voted
COR
2004
85views more  COR 2004»
15 years 3 months ago
A heuristic method for large-scale multi-facility location problems
Abstract. A heuristic method for solving large-scale multi
Yuri Levin, Adi Ben-Israel
COR
2007
105views more  COR 2007»
15 years 3 months ago
Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
Column generation has proven to be efficient in solving the linear programming relaxation of large scale instances ofthemultiple-depotvehicleschedulingproblem(MDVSP).Howeverdif...
Amar Oukil, Hatem Ben Amor, Jacques Desrosiers, Hi...
JSAT
2006
94views more  JSAT 2006»
15 years 3 months ago
A Note on the Use of Independent Sets for the k-SAT Problem
An independent set of variables is one in which no two variables occur in the same clause in a given k-SAT instance. Recently, independent sets have obtained more attention. Due t...
Konstantin Kutzkov
132
Voted
AAAI
1997
15 years 4 months ago
Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
Aaron A. Armstrong, Edmund H. Durfee
TON
2002
91views more  TON 2002»
15 years 3 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...