4679 search results - page 47 / 936 » Modeling When Connections Are the Problem |
103
click to vote
ECIS
2001
15 years 2 months ago
2001
The authors describe on going research to uncover the architectonic nature of artefacts and see how these may be related to high-level, but also grounded, model of the original pr...
127
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
CP
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
115
click to vote
INFOCOM
1996
IEEE
15 years 5 months ago
1996
IEEE
: We consider the combined control problem of connection admission, flow rate, and bandwidth allocation (capacity, service-rate) under nonstationary conditions. A fluid flow model ...
126
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 1 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...