Sciweavers

3656 search results - page 457 / 732
» Compact Location Problems
Sort
View
AAAI
1996
15 years 8 months ago
Lazy Arc Consistency
Arc consistency filtering is widely used in the framework of binary constraint satisfaction problems: with a low complexity, inconsistency may be detected,and domains are filtered...
Thomas Schiex, Jean-Charles Régin, Christin...
CORR
2008
Springer
138views Education» more  CORR 2008»
15 years 6 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
199
Voted
CCE
2004
15 years 6 months ago
Pharmaceutical supply chains: key issues and strategies for optimisation
Supply chain optimisation is now a major research theme in process operations and management. A great deal of research has been undertaken on facility location and design, invento...
Nilay Shah
COCOA
2010
Springer
15 years 4 months ago
Time Optimal Algorithms for Black Hole Search in Rings
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...
IMC
2010
ACM
15 years 4 months ago
Speed testing without speed tests: estimating achievable download speed from passive measurements
How fast is the network? The speed at which real users can download content at different locations and at different times is an important metric for service providers. Knowledge o...
Alexandre Gerber, Jeffrey Pang, Oliver Spatscheck,...