1265 search results - page 95 / 253 » Algorithms for Drawing Media |
142
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
119
click to vote
FLAIRS
2003
15 years 5 months ago
2003
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
108
click to vote
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
Multi-agent problem domains may require distributed algorithms for a variety of reasons: local sensors, limitations of communication, and availability of distributed computational...
106
click to vote
PODC
1996
ACM
15 years 8 months ago
1996
ACM
Drawing ideas from previous authors, we present a new non-blocking concurrent queue algorithm and a new twolock queue algorithm in which one enqueue and one dequeue can proceed co...
143
click to vote
IAJIT
2010
15 years 2 months ago
2010
: This paper presents an algorithm, which is a hybrid-computing algorithm in representing solid model. The proposed algorithm contains two steps namely reconstruction and represent...