Sciweavers

1569 search results - page 206 / 314
» Programming contest strategy
Sort
View
ISMB
1993
13 years 10 months ago
Discovering Sequence Similarity by the Algorithmic Significance Method
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
Aleksandar Milosavljevic
AIIDE
2009
13 years 10 months ago
Adapting Game-Playing Agents to Game Requirements
We examine the problem of self-adaptation in game-playing agents as the game requirements evolve incrementally. The goal of our current work is to develop an interactive environme...
Joshua Jones, Chris Parnin, Avik Sinharoy, Spencer...
ICA
2010
Springer
13 years 9 months ago
Double Sparsity: Towards Blind Estimation of Multiple Channels
We propose a framework for blind multiple filter estimation from convolutive mixtures, exploiting the time-domain sparsity of the mixing filters and the disjointness of the sources...
Prasad Sudhakar, Simon Arberet, Rémi Gribon...
COR
2008
105views more  COR 2008»
13 years 9 months ago
Minimizing the object dimensions in circle and sphere packing problems
Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, ...
Ernesto G. Birgin, F. N. C. Sobral
DI
2007
81views more  DI 2007»
13 years 9 months ago
Using every part of the buffalo in Windows memory analysis
All Windows memory analysis techniques depend on the examiner’s ability to translate the virtual addresses used by programs and operating system components into the true locatio...
Jesse D. Kornblum