Sciweavers

543 search results - page 91 / 109
» New Upper Bounds for MaxSat
Sort
View
AHSWN
2008
92views more  AHSWN 2008»
14 years 9 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
CORR
2008
Springer
83views Education» more  CORR 2008»
14 years 9 months ago
Alternating Hierarchies for Time-Space Tradeoffs
Nepomnjascii's Theorem states that for all 0 < 1 and k > 0 the class of languages recognized in nondeterministic time nk and space n , NTISP[nk , n ], is contained in ...
Chris Pollett, Eric Miles
CONSTRAINTS
2007
83views more  CONSTRAINTS 2007»
14 years 9 months ago
Generic Incremental Algorithms for Local Search
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...
Magnus Ågren, Pierre Flener, Justin Pearson
JSYML
2008
74views more  JSYML 2008»
14 years 9 months ago
Omitting types for finite variable fragments and complete representations of algebras
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
Tarek Sayed Ahmed, Hajnal Andréka, Istv&aac...
OL
2008
79views more  OL 2008»
14 years 9 months ago
A simpler and tighter redundant Klee-Minty construction
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...
Eissa Nematollahi, Tamás Terlaky