21 search results - page 2 / 5 » isaac 2000 |
ISAAC
2000
Springer
13 years 8 months ago
2000
Springer
We describe an algorithm for enumerating all vertices, edges and faces of a planar subdivision stored in any of the usual pointer-based representations, while using only a constant...
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...
VL
2000
IEEE
13 years 9 months ago
2000
IEEE
Isaac is a programing language for geometric reasoning intended for controlling mobile robots, currently under development at NMSU. Due to the application area, handling input and...
AGENTS
2000
Springer
13 years 9 months ago
2000
Springer
Multi-agent teamwork is critical in a large number of agent applications, including training, education, virtual enterprises and collective robotics. Tools that can help humans an...
ISAAC
2000
Springer
13 years 8 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...