Sciweavers

693 search results - page 84 / 139
» Categorical Properties of The Complex Numbers
Sort
View
COMPGEOM
2005
ACM
13 years 10 months ago
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
Jonathan Richard Shewchuk
EFDBS
2001
13 years 10 months ago
Extensible Grouping and Aggregation for Data Reconciliation
New applications from the areas of analytical data processing and data integration require powerful features to condense and reconcile available data. Object-relational and other d...
Eike Schallehn, Kai-Uwe Sattler, Gunter Saake
ICAI
2003
13 years 10 months ago
Threshold Behavior in a Boolean Network Model for SAT
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
Alejandro Bugacov, Aram Galstyan, Kristina Lerman
CEC
2010
IEEE
13 years 9 months ago
Towards scalability in niching methods
— The scaling properties of multimodal optimization methods have seldom been studied, and existing studies often concentrated on the idea that all local optima of a multimodal fu...
Marcel Kronfeld, Andreas Zell
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 8 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli