Sciweavers

4451 search results - page 191 / 891
» On Random Ordering Constraints
Sort
View
CCR
2005
129views more  CCR 2005»
15 years 5 months ago
The problem of synthetically generating IP traffic matrices: initial recommendations
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...
Antonio Nucci, Ashwin Sridharan, Nina Taft
WIOPT
2010
IEEE
15 years 3 months ago
Resource allocation for cross-layer utility maximization in multi-hop wireless networks in the presence of self interference
Abstract—The cross-layer utility maximization problem subject to stability constraints is considered for a multi-hop wireless network. A time slotted network, where the channel g...
Chathuranga Weeraddana, Marian Codreanu, Matti Lat...
135
Voted
CP
2004
Springer
15 years 10 months ago
Leveraging the Learning Power of Examples in Automated Constraint Acquisition
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
Christian Bessière, Remi Coletta, Eugene C....
BIBE
2007
IEEE
151views Bioinformatics» more  BIBE 2007»
15 years 6 months ago
On the Effectiveness of Constraints Sets in Clustering Genes
—In this paper, we have modified a constrained clustering algorithm to perform exploratory analysis on gene expression data using prior knowledge presented in the form of constr...
Erliang Zeng, Chengyong Yang, Tao Li, Giri Narasim...
JACM
2010
116views more  JACM 2010»
15 years 3 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára