Sciweavers

2410 search results - page 114 / 482
» Multiset Ordering Constraints
Sort
View
151
Voted
CPAIOR
2010
Springer
15 years 3 months ago
Automatically Exploiting Subproblem Equivalence in Constraint Programming
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
Geoffrey Chu, Maria Garcia de la Banda, Peter J. S...
TON
2010
192views more  TON 2010»
14 years 11 months ago
Delay analysis for wireless networks with single hop traffic and general interference constraints
We consider a class of wireless networks with general interference constraints on the set of links that can be served simultaneously at any given time. We restrict the traffic to b...
Gagan Raj Gupta, Ness B. Shroff
CORR
2011
Springer
160views Education» more  CORR 2011»
14 years 8 months ago
Compositional Model Repositories via Dynamic Constraint Satisfaction with Order-of-Magnitude Preferences
The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mecha...
Jeroen Keppens, Qiang Shen
180
Voted
CVPR
2012
IEEE
13 years 7 months ago
Large scale metric learning from equivalence constraints
In this paper, we raise important issues on scalability and the required degree of supervision of existing Mahalanobis metric learning methods. Often rather tedious optimization p...
Martin Köstinger, Martin Hirzer, Paul Wohlhar...
PODC
2012
ACM
13 years 7 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...