Sciweavers

3082 search results - page 499 / 617
» New Bounds for the Controller Problem
Sort
View
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
15 years 11 months ago
Robust solutions for combinatorial auctions
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
Alan Holland, Barry O'Sullivan
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 10 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
DEM
2001
Springer
247views GIS» more  DEM 2001»
15 years 10 months ago
Procedural Geometry for Real-Time Terrain Visualisation in Blueberry3D
A common concern of the real−time terrain visualisation of today is the lack of geometric detail, when the terrain model is studied close enough. This is primary not a problem of...
Mattias Widmark
ICDCS
1999
IEEE
15 years 10 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
RECOMB
1997
Springer
15 years 10 months ago
On the complexity and approximation of syntenic distance
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...