Sciweavers

10054 search results - page 1785 / 2011
» On the Complexity of Function Learning
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 3 months ago
Approximate Judgement Aggregation
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
Ilan Nehama
ICMS
2010
15 years 3 months ago
The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra
There is a growing interest in numeric-algebraic techniques in the computer algebra community as such techniques can speed up many applications. This paper is concerned with one su...
Jihun Yu, Chee Yap, Zilin Du, Sylvain Pion, Herv&e...
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
15 years 2 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...
IGPL
2010
97views more  IGPL 2010»
15 years 2 months ago
A symbolic/subsymbolic interface protocol for cognitive modeling
Researchers studying complex cognition have grown increasingly interested in mapping symbolic cognitive architectures onto subsymbolic brain models. Such a mapping seems essential...
Patrick Simen, Thad A. Polk
150
Voted
INFORMS
2010
107views more  INFORMS 2010»
15 years 2 months ago
A Class Representative Model for Pure Parsimony Haplotyping
Haplotyping estimation from aligned Single Nucleotide Polymorphism (SNP) fragments has attracted more and more attention in the recent years due to its importance in analysis of m...
Daniele Catanzaro, Alessandra Godi, Martine Labb&e...
« Prev « First page 1785 / 2011 Last » Next »