1998 search results - page 151 / 400 » Complexity of the Cover Polynomial |
176
click to vote
COCO
2010
Springer
15 years 8 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
165
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
The approximation of surfaces to scattered data is an important problem encountered in a variety of scientific applications, such as reverse engineering, computer vision, computer...
163
click to vote
CSCLP
2007
Springer
16 years 20 days ago
2007
Springer
Temporal networks play a crucial role in modeling temporal relations in planning and scheduling applications. Temporal Networks with Alternatives (TNAs) were proposed to model alte...
189
click to vote
ICRA
2006
IEEE
16 years 15 days ago
2006
IEEE
— We study the problem of generating continuous steering control for robots to completely cover a bounded region over a finite time. First, we pack the area by disks of minimum ...
160
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
The problem of fault grading for multiple path delay faults is studied and a method of obtaining the exact coverage is presented. The faults covered are represented and manipulate...