Sciweavers

1332 search results - page 101 / 267
» Combinatorial Algorithms
Sort
View
ICALP
2003
Springer
14 years 2 months ago
Online Load Balancing Made Simple: Greedy Strikes Back
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia...
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
14 years 24 days ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann
ML
2011
ACM
308views Machine Learning» more  ML 2011»
13 years 3 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
CHI
2005
ACM
14 years 9 months ago
Automatic generation of high coverage usability tests
Software systems are often complex in the number of features that are available through the user interface and consequently, the number of interactions that can occur. Such system...
Renée C. Bryce
DGCI
2005
Springer
14 years 2 months ago
Uncertain Geometry in Computer Vision
Abstract. We give an overview of the main ideas and tools that have been employed in uncertain geometry. We show how several recognition problems in computer vision can be translat...
Peter Veelaert