Sciweavers

2214 search results - page 75 / 443
» complexity 2004
Sort
View
ISAAC
2004
Springer
87views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Random Access to Advice Strings and Collapsing Results
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
Jin-yi Cai, Osamu Watanabe
GRAPHITE
2004
ACM
14 years 1 months ago
Robust, geometry-independent shadow volumes
A novel algorithm is presented that overcomes limitations of existing shadow volume algorithms when dealing with nonmanifold geometry and space partitioning. This simple algorithm...
Graham Aldridge, Eric Woods
ESWS
2004
Springer
14 years 1 months ago
Neptuno: Semantic Web Technologies for a Digital Newspaper Archive
Newspaper archives are a fundamental working tool for editorial teams. Their exploitation in digital format through the web, and the provision of technology to make this possible, ...
Pablo Castells, Ferran Perdrix, E. Pulido, Mariano...
AAAI
2004
13 years 9 months ago
Forward-Chaining Planning in Nondeterministic Domains
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work i...
Ugur Kuter, Dana S. Nau
CSREAESA
2004
13 years 9 months ago
Intelligent Resource Agents for Embedded Systems
This paper presents a reconfigurable resource support mechanism to address scheduling issues in distributed embedded environment. A configurable object architecture is employed to...
En-Hsin Huang, Tzilla Elrad