Sciweavers

2354 search results - page 126 / 471
» Assignment Problems
Sort
View
TON
2002
91views more  TON 2002»
15 years 1 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...
ICALP
2007
Springer
15 years 8 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
CDC
2010
IEEE
101views Control Systems» more  CDC 2010»
14 years 9 months ago
Maintaining connectivity among multiple agents in cyclic pursuit: A geometric approach
This paper studies the connectivity maintenance problem in linear and nonlinear cyclic pursuit, when different control gains are assigned to each agent. Feasibility/infeasibility c...
Fabio Morbidi, Antonio Giannitrapani, Domenico Pra...
163
Voted
PAMI
2008
155views more  PAMI 2008»
15 years 1 months ago
Subclass Problem-Dependent Design for Error-Correcting Output Codes
A common way to model multiclass classification problems is by means of Error-Correcting Output Codes (ECOCs). Given a multiclass problem, the ECOC technique designs a code word fo...
Sergio Escalera, David M. J. Tax, Oriol Pujol, Pet...
AAAI
2006
15 years 3 months ago
Heuristic Search and Information Visualization Methods for School Redistricting
We describe an application of AI search and information visualization techniques to the problem of school redistricting, in which students are assigned to home schools within a co...
Marie desJardins, Blazej Bulka, Ryan Carr, Andrew ...