1486 search results - page 44 / 298 » Algorithms for two-box covering |
COLT
1995
Springer
15 years 4 months ago
1995
Springer
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
77
Voted
WECWIS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper we present a novel approach and a system for automated selection of building blocks, by exploiting business processes semantics. The selection process is based on a ...
101
click to vote
COCOON
2001
Springer
15 years 5 months ago
2001
Springer
We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item ...
88
Voted
ANTS
2000
Springer
15 years 5 months ago
2000
Springer
We shall discuss the idea of finding all rational points on a curve C by first finding an associated collection of curves whose rational points cover those of C. This classical ...
95
Voted
STRINGOLOGY
2008
15 years 2 months ago
2008
Abstract. We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T[1]T[2] . . . T...