925 search results - page 28 / 185 » Connectivity on Complete Lattices |
IROS
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
102
click to vote
ISMVL
2007
IEEE
15 years 6 months ago
2007
IEEE
We define a resolution-style rule for solving the Max-SAT problem of Signed CNF formulas (Signed Max-SAT) and prove that our rule provides a complete calculus for that problem. F...
ALDT
2009
Springer
15 years 6 months ago
2009
Springer
Judgment aggregation is a formal theory reasoning about how a group of agents can aggregate individual judgments on connected propositions into a collective judgment on the same pr...
COLING
2008
15 years 1 months ago
2008
We present a complete system that generates Japanese stand-up comedy. Different modules generating different types of jokes are tied together into a performance where all jokes ar...
100
click to vote
CPAIOR
2008
Springer
15 years 1 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...