3495 search results - page 284 / 699 » On the random satisfiable process |
168
click to vote
WWW
2009
ACM
16 years 8 months ago
2009
ACM
We introduce a multi-label classification model and algorithm for labeling heterogeneous networks, where nodes belong to different types and different types have different sets of...
183
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
In order to be efficient with selfish programmers, a multicore transactional memory (TM) system must be designed such that it is compatible with good programming incentives (GPI),...
208
click to vote
EUROCAST
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
207
click to vote
PIMRC
2008
IEEE
16 years 1 months ago
2008
IEEE
—Most publications on the capacity and performance of wireless ad hoc networks share the underlying assumption of a uniform random distribution of nodes. In this paper, we study ...
175
click to vote
ICRA
2007
IEEE
16 years 1 months ago
2007
IEEE
— Designing algorithms for multi-robot systems can be a complex and difficult process: the cost of such systems can be very high, collecting experimental data can be timeconsumi...