Sciweavers

21 search results - page 2 / 5
» isaac 2000
Sort
View
ISAAC
2000
Springer
100views Algorithms» more  ISAAC 2000»
13 years 9 months ago
An Improved Algorithm for Subdivision Traversal without Extra Storage
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...
Prosenjit Bose, Pat Morin
ISAAC
2003
Springer
75views Algorithms» more  ISAAC 2003»
13 years 10 months ago
On the Existence and Determination of Satisfactory Partitions in a Graph
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...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
VL
2000
IEEE
158views Visual Languages» more  VL 2000»
13 years 10 months ago
A Common Framework for Input, Processing, and Output in a Rule-Based Visual Language
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...
Joseph J. Pfeiffer Jr., Rick L. Vinyard Jr., Berna...
AGENTS
2000
Springer
13 years 10 months ago
Automated assistants to aid humans in understanding team behaviors
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...
Taylor Raines, Milind Tambe, Stacy Marsella
ISAAC
2000
Springer
135views Algorithms» more  ISAAC 2000»
13 years 9 months ago
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
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...
Jianer Chen, Iyad A. Kanj