Sciweavers

12950 search results - page 2515 / 2590
» On Optimal Timed Strategies
Sort
View
CP
2007
Springer
14 years 1 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
EUROCAST
2007
Springer
182views Hardware» more  EUROCAST 2007»
14 years 1 months ago
A k-NN Based Perception Scheme for Reinforcement Learning
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
José Antonio Martin H., Javier de Lope Asia...
EUROSSC
2007
Springer
14 years 1 months ago
The Design of a Pressure Sensing Floor for Movement-Based Human Computer Interaction
This paper addresses the design of a large area, high resolution, networked pressure sensing floor with primary application in movement-based human-computer interaction (M-HCI). T...
Sankar Rangarajan, Assegid Kidané, Gang Qia...
FPGA
2007
ACM
163views FPGA» more  FPGA 2007»
14 years 1 months ago
Improved SAT-based Boolean matching using implicants for LUT-based FPGAs
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
Jason Cong, Kirill Minkovich
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
14 years 1 months ago
Coevolution of intelligent agents using cartesian genetic programming
A coevolutionary competitive learning environment for two antagonistic agents is presented. The agents are controlled by a new kind of computational network based on a compartment...
Gul Muhammad Khan, Julian Francis Miller, David M....
« Prev « First page 2515 / 2590 Last » Next »