281 search results - page 45 / 57 » The Complexity of Planar Counting Problems |
DAC
1996
ACM
15 years 1 months ago
1996
ACM
Boundary element methods (BEM) are often used for complex 3-D capacitance extraction because of their efficiency, ease of data preparation, and automatic handling of open regions. ...
CCCG
2010
14 years 11 months ago
2010
In this paper, we consider a special type of triangular range search for a planar point set S in the I/O-model. Here, two sides of the query triangle are parallel to the coordinat...
SYNASC
2006
IEEE
15 years 3 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
107
click to vote
ISARCS
2010
14 years 11 months ago
2010
Voting is a critical component of any democratic process; and electronic voting systems should be developed following best practices for critical system development. E-voting has i...
TCS
2008
14 years 9 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...