Sciweavers

3317 search results - page 254 / 664
» Strategies in Rigid-Variable Methods
Sort
View

Publication
222views
16 years 3 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis
PERVASIVE
2009
Springer
16 years 1 months ago
Securing RFID Systems by Detecting Tag Cloning
Cloning of RFID tags can lead to financial losses in many commercial RFID applications. There are two general strategies to provide security: prevention and detection. The securit...
Mikko Lehtonen, Daniel Ostojic, Alexander Ilic, Fl...
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
16 years 1 months ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang
IROS
2008
IEEE
129views Robotics» more  IROS 2008»
16 years 1 months ago
Near-optimal navigation of high speed mobile robots on uneven terrain
—This paper proposes a method for near-optimal navigation of high speed mobile robots on uneven terrain. The method relies on a layered control strategy. A high-level planning la...
Karl Iagnemma, Shingo Shimoda, Zvi Shiller
CEC
2007
IEEE
16 years 29 days ago
Graph design by graph grammar evolution
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...
Martin H. Luerssen, David M. W. Powers