Sciweavers

5169 search results - page 681 / 1034
» Locality approximation using time
Sort
View
PG
1999
IEEE
15 years 10 months ago
Subdivision Surface Fitting to a Range of Points
The objective of this research is to apply the subdivision surface for surface fitting problems when generating surfaces from data points or polyhedral models. The basic idea is t...
Hiromasa Suzuki, Shingo Takeuchi, Fumihiko Kimura,...
PPSN
1998
Springer
15 years 10 months ago
Restart Scheduling for Genetic Algorithms
Abstract. In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses ...
Alex S. Fukunaga
CIKM
2005
Springer
15 years 8 months ago
DIST: a distributed spatio-temporal index structure for sensor networks
We consider the general problem of tracking moving objects in sensor networks. The specific application we consider is that of tracking a chemical plume moving over a large infra...
Anand Meka, Ambuj K. Singh
134
Voted
EUROPAR
2008
Springer
15 years 8 months ago
Deque-Free Work-Optimal Parallel STL Algorithms
This paper presents provable work-optimal parallelizations of STL (Standard Template Library) algorithms based on the workstealing technique. Unlike previous approaches where a deq...
Daouda Traoré, Jean-Louis Roch, Nicolas Mai...
CDES
2007
82views Hardware» more  CDES 2007»
15 years 7 months ago
Efficient Global Fault Collapsing for Combinational Library Modules
—Fault collapsing is the process of reducing the number of faults by using redundance and equivalence/dominance relationships among faults. Exact global fault collapsing can be e...
Hussain Al-Asaad