1964 search results - page 279 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
103
click to vote
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
This paper studies distributed scheduling of parallel I/O data transfers on systems that provide data replication. In our previous work, we proposed a centralized algorithm for so...
112
click to vote
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
146
click to vote
ASC
2011
14 years 9 months ago
2011
In this work, a novel optimization framework is proposed that allows the improvement of Quality of Service levels in TCP/IP based networks, by configuring the routing weights of ...
103
Voted
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
The l-bfgs limited-memory quasi-Newton method is the algorithm of choice for optimizing the parameters of large-scale log-linear models with L2 regularization, but it cannot be us...
128
click to vote
TIP
1998
15 years 2 months ago
1998
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...