Sciweavers

98 search results - page 15 / 20
» An agent-based algorithm for generalized graph colorings
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
SIROCCO
1997
13 years 8 months ago
Static Frequency Assignment in Cellular Networks
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
Lata Narayanan, Sunil M. Shende
HIPC
2005
Springer
14 years 1 months ago
Cooperative Instruction Scheduling with Linear Scan Register Allocation
Abstract. Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear ...
Khaing Khaing Kyi Win, Weng-Fai Wong
FOCS
2006
IEEE
14 years 1 months ago
A simple condition implying rapid mixing of single-site dynamics on spin systems
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
Thomas P. Hayes
MM
2006
ACM
103views Multimedia» more  MM 2006»
14 years 1 months ago
Progressive cut
Recently, interactive image cutout technique becomes prevalent for image segmentation problem due to its easy-to-use nature. However, most existing stroke-based interactive object...
Chao Wang, Qiong Yang, Mo Chen, Xiaoou Tang, Zhong...