2398 search results - page 330 / 480 » Constraint Programming and Graph Algorithms |
114
click to vote
ICRA
2010
IEEE
15 years 3 months ago
2010
IEEE
— This paper presents a strategy for planning robot motions in dynamic, cluttered, and uncertain environments. Successful and efficient operation in such environments requires r...
148
click to vote
ICSE
2008
IEEE-ACM
16 years 5 months ago
2008
IEEE-ACM
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...
134
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
We develop a sound foundation for model checking algorithms for the class of PRS-style BDI agents, by showing how a reachability graph for any given PRS-type agent can be construc...
145
click to vote
SAT
2004
Springer
15 years 10 months ago
2004
Springer
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
130
Voted
ISMB
1997
15 years 6 months ago
1997
Seq7 is a newprogramfor generating multiple structure-based alignments of RNAsequences. Byusing a variant of Dijkstra’s algorithm to find the shortest path through a specially c...