Sciweavers

9842 search results - page 371 / 1969
» Problem complexity
Sort
View
UC
2009
Springer
16 years 1 months ago
Resource-Competing Oscillator Network as a Model of Amoeba-Based Neurocomputer
Abstract. An amoeboid organism, Physarum, exhibits rich spatiotemporal oscillatory behavior and various computational capabilities. Previously, the authors created a recurrent neur...
Masashi Aono, Yoshito Hirata, Masahiko Hara, Kazuy...
CGI
2004
IEEE
15 years 10 months ago
Fast Environmental Lighting for Local-PCA Encoded BTFs
Rendering geometric models with complex surface materials in arbitrary lighting environments is a challenging problem. In order to relight and render geometries covered with compl...
Gero Müller, Jan Meseth, Reinhard Klein
STOC
2005
ACM
104views Algorithms» more  STOC 2005»
16 years 7 months ago
Beyond NP: the work and legacy of Larry Stockmeyer
Shortly after Steven Cook and Richard Karp showed the existence of many natural NP-complete languages, researchers started to realize the great importance of the P versus NP probl...
Lance Fortnow
COMPGEOM
2011
ACM
14 years 10 months ago
Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains
Several recent works considered cooperative cleaning in static and dynamic environments, which incorporates a swarm of simple robots cleaning an expanding region of contaminated c...
Thilo Beckmann, Rolf Klein, David Kriesel, Elmar L...
RR
2010
Springer
15 years 5 months ago
Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
Reinhard Pichler, Axel Polleres, Sebastian Skritek...