Sciweavers

6894 search results - page 1197 / 1379
» Generation Problems
Sort
View
ATAL
2009
Springer
15 years 7 months ago
Efficient physics-based planning: sampling search via non-deterministic tactics and skills
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
Stefan Zickler, Manuela M. Veloso
LOGCOM
2008
104views more  LOGCOM 2008»
15 years 6 months ago
Testing the Reasoning for Question Answering Validation
Question Answering (QA) is a task that deserves more collaboration between Natural Language Processing (NLP) and Knowledge Representation (KR) communities, not only to introduce r...
Anselmo Peñas, Álvaro Rodrigo, Valen...
WWW
2008
ACM
16 years 7 months ago
A combinatorial allocation mechanism with penalties for banner advertising
Most current banner advertising is sold through negotiation thereby incurring large transaction costs and possibly suboptimal allocations. We propose a new automated system for se...
Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, ...
KDD
2000
ACM
133views Data Mining» more  KDD 2000»
15 years 10 months ago
Data selection for support vector machine classifiers
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
Glenn Fung, Olvi L. Mangasarian
ML
2000
ACM
154views Machine Learning» more  ML 2000»
15 years 6 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
« Prev « First page 1197 / 1379 Last » Next »