Sciweavers

3575 search results - page 144 / 715
» Presentations of computably enumerable reals
Sort
View
COCOA
2007
Springer
16 years 16 days ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle
SIGECOM
2005
ACM
90views ECommerce» more  SIGECOM 2005»
15 years 12 months ago
ICE: an iterative combinatorial exchange
We present the first design for a fully expressive iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language that is concise and expressive ...
David C. Parkes, Ruggiero Cavallo, Nick Elprin, Ad...
STACS
1998
Springer
15 years 10 months ago
On Disguised Double Horn Functions and Extensions
We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1-decis...
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
DIS
2007
Springer
15 years 10 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
PDPTA
2007
15 years 7 months ago
Mobile Services Based on Client-Server or P2P Architectures facing Issues of Context-Awareness and Heterogeneous
With the advent of mobile computing and mobile services becoming more widespread and more complex, the development process of those services requires an ever more important focus o...
Robert Schmohl, Uwe Baumgarten