Sciweavers

221 search results - page 9 / 45
» Analyzing the Implicit Computational Complexity of object-or...
Sort
View
JMMA
2002
90views more  JMMA 2002»
14 years 9 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...
ICRA
2006
IEEE
131views Robotics» more  ICRA 2006»
15 years 3 months ago
Proximity Queries between Convex Objects: an Interior Point Approach for Implicit Surfaces
— This paper presents an interior point approach to exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computatio...
Nilanjan Chakraborty, Jufeng Peng, Srinivas Akella...
LPNMR
2007
Springer
15 years 3 months ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
APCSAC
2007
IEEE
15 years 4 months ago
Implicit Transactional Memory in Kilo-Instruction Multiprocessors
Although they have been the main server technology for many years, multiprocessors are undergoing a renaissance due to multi-core chips and the attractive scalability properties of...
Marco Galluzzi, Enrique Vallejo, Adrián Cri...
CSCWD
2008
Springer
14 years 11 months ago
Computer aided architectural design: Wayfinding complexity analysis
Design is a complex process often described as a collaboration between a designer and herself. In architectural design, a designer must consider the selection of a subset of actio...
Brett Bojduj, Ben Weber, Kai-Florian Richter, Sven...