4903 search results - page 25 / 981 » The Set Covering Machine |
COLT
1995
Springer
13 years 11 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...
GC
2007
Springer
13 years 7 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
BPM
2009
Springer
14 years 2 months ago
2009
Springer
The effect of using automated auditing tools to detect compliance failures in unmanaged business processes is investigated. In the absence of a process execution engine, compliance...