Sciweavers

230 search results - page 41 / 46
» Computing Optimal Strategies to Commit to in Stochastic Game...
Sort
View
AMDO
2010
Springer
13 years 4 months ago
Analysing the Influence of Vertex Clustering on PCA-Based Dynamic Mesh Compression
Abstract. The growth of computational power of contemporary hardware causes technologies working with 3D-data to expand. Examples of the use of this kind of data can be found in ge...
Jan Rus, Libor Vása
ICALP
2003
Springer
14 years 1 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
AUTOMATICA
2007
124views more  AUTOMATICA 2007»
13 years 8 months ago
Motion planning in uncertain environments with vision-like sensors
In this work we present a methodology for intelligent path planning in an uncertain environment using vision like sensors, i.e., sensors that allow the sensing of the environment ...
Suman Chakravorty, John L. Junkins
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 9 months ago
How social structure and institutional order co-evolve beyond instrumental rationality
This study proposes an agent-based model where adaptively learning agents with local vision who are situated in the Prisoner’s Dilemma game change their strategy and location as...
Jae-Woo Kim
CPM
1999
Springer
92views Combinatorics» more  CPM 1999»
14 years 4 days ago
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
Serafim Batzoglou, Sorin Istrail