2479 search results - page 117 / 496 » Quantum complexity theory |
175
click to vote
JC
1998
15 years 6 months ago
1998
The problem of global solution of Fredholm integral equations is studied. This means that one seeks to approximate the full solution function (as opposed to the local problem, whe...
174
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
169
click to vote
GLVLSI
2009
IEEE
2009
IEEE
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
16 years 1 months ago
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
181
click to vote
KCAP
2003
ACM
16 years 1 days ago
2003
ACM
Because it is difficult to engineer a complex ontology with time, we here consider a method that allows for factorizing the complexity of the engineering process, FONTE (Factoriz...
162
click to vote
CSCLP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...