Sciweavers

14386 search results - page 118 / 2878
» The Chinese Generals Problem
Sort
View
SMA
2009
ACM
134views Solid Modeling» more  SMA 2009»
15 years 10 months ago
Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
143
Voted
IROS
2006
IEEE
108views Robotics» more  IROS 2006»
15 years 9 months ago
A Lie Algebraic Approach for Consistent Pose Registration for General Euclidean Motion
Abstract— We study the problem of registering local relative pose estimates to produce a global consistent trajectory of a moving robot. Traditionally, this problem has been stud...
Motilal Agrawal
136
Voted
AI
2003
Springer
15 years 8 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin
125
Voted
CSB
2004
IEEE
158views Bioinformatics» more  CSB 2004»
15 years 7 months ago
Algorithms for Association Study Design Using a Generalized Model of Haplotype Conservation
There is considerable interest in computational methods to assist in the use of genetic polymorphism data for locating disease-related genes. Haplotypes, contiguous sets of correl...
Russell Schwartz
140
Voted
GCC
2006
Springer
15 years 7 months ago
General Running Service: An Execution Framework for Executing Legacy Program on Grid
Legacy program execution system, which is necessary for Grid to enable users to reuse all legacy programs without reengineering source codes, is still an open problem. We propose ...
Likun Liu, Yongwei Wu, Guangwen Yang, Ruyue Ma, Fe...