Sciweavers

3946 search results - page 181 / 790
» The computational complexity of choice sets
Sort
View
GECCO
2003
Springer
100views Optimization» more  GECCO 2003»
15 years 11 months ago
Dense and Switched Modular Primitives for Bond Graph Model Design
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
Kisung Seo, Zhun Fan, Jianjun Hu, Erik D. Goodman,...
IPPS
2003
IEEE
15 years 12 months ago
MUSE: A Software Oscilloscope for Clusters and Grids
Oscilloscopes and their cousins, logic analyzers, are the tools of choice for difficult electronic hardware problems. In the hands of a skilled engineer or technician, these tool...
Mark K. Gardner, Michael Broxton, Adam Engelhart, ...
ICPR
2006
IEEE
16 years 7 months ago
Bayesian Imitation of Human Behavior in Interactive Computer Games
Modern interactive computer games provide the ability to objectively record complex human behavior, offering a variety of interesting challenges to the pattern-recognition communi...
Bernard Gorman, Christian Bauckhage, Christian Thu...
172
Voted
ISMIR
2001
Springer
208views Music» more  ISMIR 2001»
15 years 11 months ago
The JRing System for Computer-Assisted Musicological Analysis
Among other factors, high complexity and mandatory expert computer knowledge make many music IR and music analysis systems unsuitable for the majority of largely computer-illitera...
Andreas Kornstädt
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 9 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich