4865 search results - page 817 / 973 » The Complexity of Graph Connectivity |
130
Voted
VMV
2004
15 years 5 months ago
2004
Efficiently rendering highly structured models distant from the viewer constitutes a difficult task since the geometric complexity has to be reduced extremely while simultaneously...
134
click to vote
WICSA
2004
15 years 5 months ago
2004
Research domains such as active networks, ad-hoc networks, ubiquitous computing, pervasive computing, grid computing, and sensor networks, clearly show that computer networks will...
130
Voted
AAAI
2000
15 years 5 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
238
Voted
AVI
2000
15 years 5 months ago
2000
Declarative models play an important role in most software design activities, by allowing designs to be constructed that selectively abstract over complex implementation details. ...
136
Voted
UAI
2003
15 years 5 months ago
2003
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or setvalued). This is a fundamental pro...