2434 search results - page 181 / 487 » Algorithmic Randomness of Closed Sets |
160
Voted
ICST
2010
IEEE
15 years 2 months ago
2010
IEEE
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
145
click to vote
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
126
click to vote
COR
2008
15 years 4 months ago
2008
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
137
click to vote
EOR
2006
15 years 4 months ago
2006
Flexibility and automation in assembly lines can be achieved by the use of robots. The robotic assembly line balancing (RALB) problem is defined for robotic assembly line, where d...
142
click to vote
PAMI
2006
15 years 3 months ago
2006
A visual search is required when applying a recognition process on a scene containing multiple objects. In such cases, we would like to avoid an exhaustive sequential search. This...