Sciweavers

3244 search results - page 370 / 649
» On convex complexity measures
Sort
View
CG
1998
Springer
15 years 11 months ago
Relevance Cuts: Localizing the Search
Humans can e ectively navigate through large search spaces, enabling them to solve problems with daunting complexity. This is largely due to an ability to successfully distinguish ...
Andreas Junghanns, Jonathan Schaeffer
ER
1998
Springer
145views Database» more  ER 1998»
15 years 11 months ago
Design and Analysis of Quality Information for Data Warehouses
Data warehouses are complex systems that have to deliver highly-aggregated, high quality data from heterogeneous sources to decision makers. Due to the dynamic change in the requir...
Manfred A. Jeusfeld, Christoph Quix, Matthias Jark...
TACAS
1998
Springer
131views Algorithms» more  TACAS 1998»
15 years 11 months ago
Detecting Races in Relay Ladder Logic Programs
Relay Ladder Logic (RLL) [4] is a programming language widely used for complex embedded control applications such as manufacturing and amusement park rides. The cost of bugs in RLL...
Alexander Aiken, Manuel Fähndrich, Zhendong S...
WG
1998
Springer
15 years 11 months ago
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
AGENTS
1997
Springer
15 years 11 months ago
Go with the Flow: Synthetic Vision for Autonomous Animated Creatures
Real-time obstacle avoidance and low-level navigation is a fundamental problem for autonomous animated creatures. Here we present an ethologically inspired approach to this proble...
Bruce Blumberg