183 search results - page 13 / 37 » Complete Minors and Independence Number |
SIROCCO
2001
13 years 9 months ago
2001
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
IOR
2008
13 years 7 months ago
2008
: A continuous review two-echelon inventory system with a central warehouse and a number of non-identical retailers is considered. The retailers face independent Poisson demand and...
AAAI
2012
11 years 10 months ago
2012
In many mechanisms (especially online mechanisms), a strategic agent can influence the outcome by creating multiple false identities. We consider voting settings where the mechan...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...