Sciweavers

1921 search results - page 196 / 385
» Making AC-3 an Optimal Algorithm
Sort
View
PR
2006
108views more  PR 2006»
15 years 2 months ago
Boosted discriminant projections for nearest neighbor classification
In this paper we introduce a new embedding technique to find the linear projection that best projects labeled data samples into a new space where the performance of a Nearest Neig...
David Masip, Jordi Vitrià
LION
2007
Springer
198views Optimization» more  LION 2007»
15 years 8 months ago
Multiobjective Landscape Analysis and the Generalized Assignment Problem
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...
Deon Garrett, Dipankar Dasgupta
156
Voted
AIPS
2009
15 years 3 months ago
Navigation Planning in Probabilistic Roadmaps with Uncertainty
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
Michael Kneebone, Richard Dearden
169
Voted
GECCO
2008
Springer
178views Optimization» more  GECCO 2008»
15 years 3 months ago
Agent Smith: a real-time game-playing agent for interactive dynamic games
The goal of this project is to develop an agent capable of learning and behaving autonomously and making decisions quickly in a dynamic environment. The agent’s environment is a...
Ryan K. Small
VLSID
2002
IEEE
131views VLSI» more  VLSID 2002»
16 years 3 months ago
Divide-and-Conquer IDDQ Testing for Core-Based System Chips
IDDQ testing has been used as a test technique to supplement voltage testing of CMOS chips. The idea behind IDDQ testing is to declare a chip as faulty if the steady-state current...
C. P. Ravikumar, Rahul Kumar