Sciweavers

1639 search results - page 217 / 328
» Anytime Heuristic Search
Sort
View
GECCO
2009
Springer
200views Optimization» more  GECCO 2009»
14 years 3 months ago
Apply ant colony optimization to Tetris
Tetris is a falling block game where the player’s objective is to arrange a sequence of different shaped tetrominoes smoothly in order to survive. In the intelligence games, ag...
Xingguo Chen, Hao Wang, Weiwei Wang, Yinghuan Shi,...
ICPR
2008
IEEE
14 years 3 months ago
A novel orientation free method for online unconstrained cursive handwritten chinese word recognition
In this paper, we propose an orientation free method for unconstrained cursive handwritten Chinese word recognition. By a novel gravity center balancing method, the orientation of...
Teng Long, Lianwen Jin
ISCC
2008
IEEE
130views Communications» more  ISCC 2008»
14 years 3 months ago
A graph theory based scheduling algorithm For MIMO-CDMA systems using zero forcing beamforming
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
Elmahdi Driouch, Wessam Ajib
SIBGRAPI
2008
IEEE
14 years 3 months ago
A New Training Algorithm for Pattern Recognition Technique Based on Straight Line Segments
Recently, a new Pattern Recognition technique based on straight line segments (SLSs) was presented. The key issue in this new technique is to find a function based on distances b...
João Henrique Burckas Ribeiro, Ronaldo Fumi...
ECBS
2007
IEEE
122views Hardware» more  ECBS 2007»
14 years 3 months ago
Time- and Space-Efficient Evaluation of Sparse Boolean Functions in Embedded Software
The paper addresses software implementation of large sparse systems of Boolean functions. Fast evaluation of such functions with the smallest memory consumption is often required ...
Vaclav Dvorak