4679 search results - page 630 / 936 » Modeling When Connections Are the Problem |
154
click to vote
NIPS
2003
15 years 8 months ago
2003
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
155
click to vote
AAAI
1998
15 years 8 months ago
1998
In design, multiple disparate goals must be addressed simultaneously. It is the thesis of this work that problems in two-dimensional layout design can be solved by collaboration a...
141
click to vote
WSC
2000
15 years 8 months ago
2000
This paper deals with estimating small tail probabilities of the steady-state waiting time in a GI/GI/1 queue with heavy-tailed (subexponential) service times. The problem of esti...
161
click to vote
ADHOCNOW
2008
Springer
15 years 7 months ago
2008
Springer
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
153
click to vote
AHSWN
2010
15 years 6 months ago
2010
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network,...