Sciweavers

2479 search results - page 166 / 496
» A Computational Theory of Working Memory
Sort
View
COMPGEOM
2006
ACM
14 years 3 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
COLT
2003
Springer
14 years 2 months ago
Preference Elicitation and Query Learning
Abstract. In this paper we initiate an exploration of relationships between “preference elicitation”, a learning-style problem that arises in combinatorial auctions, and the pr...
Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, M...
ICSE
2003
IEEE-ACM
14 years 9 months ago
Using Benchmarking to Advance Research: A Challenge to Software Engineering
Benchmarks have been used in computer science to compare the performance of computer systems, information retrieval algorithms, databases, and many other technologies. The creatio...
Susan Elliott Sim, Steve M. Easterbrook, Richard C...
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 9 months ago
Bounded Rationality, Strategy Simplification, and Equilibrium
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
Hubie Chen
DAC
2007
ACM
14 years 10 months ago
Designer-Controlled Generation of Parallel and Flexible Heterogeneous MPSoC Specification
Programming multi-processor systems-on-chip (MPSoC) involves partitioning and mapping of sequential reference code onto multiple parallel processing elements. The immense potentia...
Pramod Chandraiah, Rainer Dömer