Sciweavers

9997 search results - page 1904 / 2000
» The case for crowd computing
Sort
View
SWAT
2004
Springer
103views Algorithms» more  SWAT 2004»
15 years 3 months ago
Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
Mark de Berg, Sergio Cabello, Panos Giannopoulos, ...
SWAT
2004
Springer
163views Algorithms» more  SWAT 2004»
15 years 3 months ago
New Algorithms for Enumerating All Maximal Cliques
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
Kazuhisa Makino, Takeaki Uno
AGP
2003
IEEE
15 years 3 months ago
Interpreting Abduction in CLP
Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an effic...
Marco Gavanelli, Evelina Lamma, Paola Mello, Miche...
AGP
2003
IEEE
15 years 3 months ago
Solving Hard Disjunctive Logic Programs Faster (Sometimes)
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
Gerald Pfeifer
ISSRE
2003
IEEE
15 years 3 months ago
Reducing wasted development time via continuous testing
Testing is often performed frequently during development to ensure software reliability by catching regression errors quickly. However, stopping frequently to test also wastes tim...
David Saff, Michael D. Ernst
« Prev « First page 1904 / 2000 Last » Next »