Sciweavers

4940 search results - page 379 / 988
» On the Complexity of Universal Programs
Sort
View
AAAI
2007
15 years 9 months ago
Propagating Knapsack Constraints in Sublinear Time
We develop an efficient incremental version of an existing cost-based filtering algorithm for the knapsack constraint. On a universe of n elements, m invocations of the algorith...
Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal ...
AAAI
2010
15 years 8 months ago
Stability and Incentive Compatibility in a Kernel-Based Combinatorial Auction
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
Sébastien Lahaie
SYRCODIS
2008
153views Database» more  SYRCODIS 2008»
15 years 8 months ago
Application-Tailored XML Storage
Several native approaches to storing large XML data sets exist. In all of these approaches the internal data representation is designed to support any ad-hoc XQuery query. In this...
Maxim Grinev, Ivan Shcheklein
ACE
2004
188views Education» more  ACE 2004»
15 years 8 months ago
A Computing Education Vision for the Sight Impaired
Vision is the main sensory modality employed in learning. Teaching materials in the areas of information technology and computer engineering are highly visual in nature and vision...
Iain Murray, Helen Armstrong
ICWS
2004
IEEE
15 years 8 months ago
Building Desktop Applications with Web Services in a Message-based MVC Paradigm
Over the past decade, classic client side applications with Model-View-Controller (MVC) architecture haven't changed much but become more complex. In this paper, we present a...
Xiaohong Qiu