595 search results - page 65 / 119 » Using Constraints with Memory to Implement Variable Eliminat... |
138
click to vote
JIRS
2007
15 years 5 months ago
2007
— In this paper, we propose a novel path-planning and obstacle avoidance algorithm GODZILA for navigation in unknown environments. No prior knowledge of the environment is requir...
164
click to vote
ISSTA
2009
ACM
16 years 16 days ago
2009
ACM
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...
170
click to vote
CCECE
2006
IEEE
16 years 2 days ago
2006
IEEE
Several approaches have been proposed to accelerate the NP-complete Boolean Satisfiability problem (SAT) using reconfigurable computing. We present an FPGA based clause evaluator,...
159
click to vote
ICNP
2007
IEEE
16 years 10 days ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
168
click to vote
HIPS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper describes Rthreads (Remote threads), a software distributed shared memory system that supports sharing of global variables on clusters of computers with physically dist...