4679 search results - page 93 / 936 » Modeling When Connections Are the Problem |
119
click to vote
UAI
2003
15 years 3 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...
99
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
128
click to vote
JUCS
2006
15 years 1 months ago
2006
: Our aim is to discuss what, when and, how deep logic should be taught in the computer science education in connection with the so called "Bologna process". We survey th...
ICRA
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— Finite-range sensing and communication are factors in the connectivity of a dynamic mobile robot network. State estimation becomes a difficult problem when communicati...
126
click to vote
CSCLP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Combinatorial problems such as scheduling, resource allocation, and configuration have many attributes that can be subject of user preferences. Traditional optimization ...