Sciweavers

1871 search results - page 291 / 375
» Selecting for evolvable representations
Sort
View
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 8 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 8 months ago
Semantic peer, here are the neighbors you want!
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...
Wilma Penzo, Stefano Lodi, Federica Mandreoli, Ric...
CODES
2007
IEEE
14 years 2 months ago
A code-generator generator for multi-output instructions
We address the problem of instruction selection for Multi-Output Instructions (MOIs), producing more than one result. Such inherently parallel hardware instructions are very commo...
Hanno Scharwächter, Jonghee M. Youn, Rainer L...
SAC
2006
ACM
14 years 1 months ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
ECAI
2004
Springer
14 years 1 months ago
IPSS: A Hybrid Reasoner for Planning and Scheduling
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
María Dolores Rodríguez-Moreno, Ange...