Sciweavers

12194 search results - page 2168 / 2439
» Numberings Optimal for Learning
Sort
View
MST
2000
101views more  MST 2000»
15 years 6 months ago
Robust Parallel Computations through Randomization
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
Spyros C. Kontogiannis, Grammati E. Pantziou, Paul...
PUC
2000
97views more  PUC 2000»
15 years 6 months ago
Look, Ma, My Homepage is Mobile!
Much of the ongoing research in ubiquitous computing has concentrated on providing context information, e.g. location information, to the level of services and applications. Typic...
Roger Kehr, Andreas Zeidler
AI
1999
Springer
15 years 6 months ago
Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
Holger H. Hoos, Thomas Stützle
IWC
2002
98views more  IWC 2002»
15 years 6 months ago
Living memory: agent-based information management for connected local communities
We investigate the application of multi-agent systems to develop intelligent information interfaces for connected communities, a class of computer applications aimed at enhancing ...
Kostas Stathis, Oscar de Bruijn, Silvio Macedo
CGF
1999
126views more  CGF 1999»
15 years 6 months ago
A Shrink Wrapping Approach to Remeshing Polygonal Surfaces
Due to their simplicity and flexibility, polygonal meshes are about to become the standard representation for surface geometry in computer graphics applications. Some algorithms i...
Leif Kobbelt, Jens Vorsatz, Ulf Labsik, Hans-Peter...
« Prev « First page 2168 / 2439 Last » Next »