Sciweavers

537 search results - page 91 / 108
» A new upper bound for 3-SAT
Sort
View
CONSTRAINTS
2007
83views more  CONSTRAINTS 2007»
13 years 8 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»
13 years 8 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»
13 years 8 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
SOCO
2008
Springer
13 years 8 months ago
Interface Composition for Web Service Intermediaries
Abstract. The use of XML as a format for message exchange makes Web services well suited for composition of heterogeneous components. However, since clients must manage differences...
Sara Forghanizadeh, Eric Wohlstadter
IPM
2007
99views more  IPM 2007»
13 years 8 months ago
Percent perfect performance (PPP)
An information retrieval performance measure that is interpreted as the percent of perfect performance (PPP) can be used to study the effects of the inclusion of specific documen...
Robert M. Losee