3204 search results - page 241 / 641 » The b-chromatic Number of a Graph |
281
click to vote
FOCS
1993
IEEE
15 years 10 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
180
click to vote
DAC
2009
ACM
15 years 10 months ago
2009
ACM
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
162
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
We regarded information retrieval as a graph search problem and proposed several novel dialog strategies that can recover from misrecognition through a spoken dialog that traverse...
184
click to vote
ENC
2004
IEEE
15 years 10 months ago
2004
IEEE
This article deals with the problem of data cache for dynamic web servers. A set of requests (which number could be large) is submitted to a server for computing. Every request is...
168
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...