592 search results - page 32 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
125
click to vote
GPC
2007
Springer
15 years 8 months ago
2007
Springer
This paper focuses on two problems related to QoS-aware I/O server placement in hierarchical Grid environments. Given a hierarchical network with requests from clients, the network...
142
Voted
ICAI
2010
15 years 18 days ago
2010
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...
DAM
2007
15 years 2 months ago
2007
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
110
Voted
CPAIOR
2005
Springer
15 years 8 months ago
2005
Springer
Producing work schedules for airline crew normally results in individually different schedules. Some airlines do however want to give the same schedule to groups of people. The con...
132
Voted
ACML
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we propose a Robust Discriminant Analysis based on maximum entropy (MaxEnt) criterion (MaxEnt-RDA), which is derived from a nonparametric estimate of Renyi’s quadr...