Sciweavers

6274 search results - page 683 / 1255
» From query complexity to computational complexity
Sort
View
AAAI
2010
15 years 9 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
189
Voted
LWA
2008
15 years 8 months ago
Compensating the Semantic Bias of Spreadsheets
Spreadsheets are heavily employed in administration, financial forecasting, education, and science because of their intuitive, flexible, and direct approach to computation. They r...
Andrea Kohlhase, Michael Kohlhase
ISCAPDCS
2007
15 years 8 months ago
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
188
Voted
ISIM
2007
15 years 8 months ago
Using Matrix Decompositions in Formal Concept Analysis
One of the main problems connected with the formal concept analysis and lattice construction is the high complexity of algorithms which plays a significant role when computing all ...
Václav Snásel, Petr Gajdos, Hussam M...
AAAI
2006
15 years 8 months ago
A Two-Step Hierarchical Algorithm for Model-Based Diagnosis
For many large systems the computational complexity of complete model-based diagnosis is prohibitive. In this paper we investigate the speedup of the diagnosis process by exploiti...
Alexander Feldman, Arjan J. C. van Gemund