2354 search results - page 333 / 471 » Assignment Problems |
172
click to vote
AAAI
2011
14 years 5 months ago
2011
We consider the problem of modeling network interactions and identifying latent groups of network nodes. This problem is challenging due to the facts i) that the network nodes are...
169
click to vote
CP
2011
Springer
14 years 4 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
136
click to vote
WWW
2003
ACM
16 years 5 months ago
2003
ACM
Continuous queries are queries for which responses given to users must be continuously updated, as the sources of interest get updated. Such queries occur, for instance, during on...
143
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—A significant fraction of network events (such as topology or route changes) and the resulting performance degradation stem from premeditated network management and operational...
145
click to vote
JCO
2011
14 years 12 months ago
2011
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...