8512 search results - page 267 / 1703 » Computing Theory With Relevance |
152
click to vote
AMAI
2006
Springer
15 years 6 months ago
2006
Springer
We introduce a simple and practical method for repairing inconsistent databases. Given a possibly inconsistent database, the idea is to properly represent the underlying problem, i...
178
click to vote
CG
2005
Springer
15 years 6 months ago
2005
Springer
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...
207
click to vote
MST
2011
15 years 1 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
156
click to vote
LPNMR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
139
click to vote
QCQC
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We briefly review the development and theory of an experiment to investigate quantum computation with trapped calcium ions. The ion trap, laser and ion requirements are d...