Sciweavers

1884 search results - page 235 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
WSCG
2004
156views more  WSCG 2004»
15 years 6 months ago
Efficient Collision Detection between 2D Polygons
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
Juan José Jiménez, Rafael Jesú...
GECCO
2008
Springer
363views Optimization» more  GECCO 2008»
15 years 6 months ago
Towards high speed multiobjective evolutionary optimizers
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder
161
Voted
JMLR
2006
117views more  JMLR 2006»
15 years 5 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
CORR
2011
Springer
184views Education» more  CORR 2011»
15 years 3 days ago
Finding Shortest Path for Developed Cognitive Map Using Medial Axis
— this paper presents an enhancement of the medial axis algorithm to be used for finding the optimal shortest path for developed cognitive map. The cognitive map has been develop...
Hazim A. Farhan, Hussein H. Owaied, Suhaib I. Al-G...
COMPGEOM
1994
ACM
15 years 9 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir