Sciweavers

7716 search results - page 35 / 1544
» Can I pass
Sort
View
ICIP
1999
IEEE
13 years 11 months ago
On the Use of Context Tree for Binary Image Compression
We consider the use of a static context tree for binary image compression. The contexts are stored in the leaves of a variable-depth binary tree. The tree structure itself is full...
Pasi Fränti, Eugene I. Ageenko
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
13 years 11 months ago
"Optimal" mutation rates for genetic search
Using a set of model landscapes we examine how different mutation rates affect different search metrics. We show that very universal heuristics, such as 1/N and the error threshol...
Jorge Cervantes, Christopher R. Stephens
ACL
1998
13 years 8 months ago
Tense and Connective Constraints on the Expression of Causality
Starting from descriptions of French connectives (in particular "donc"---therefore), on the one hand, and aspectual properties of French tenses pass4 simple and imparfai...
Pascal Amsili, Corinne Rossari
CADE
2010
Springer
13 years 8 months ago
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
Markus Aderhold
GECCO
2008
Springer
229views Optimization» more  GECCO 2008»
13 years 8 months ago
EIN-WUM: an AIS-based algorithm for web usage mining
With the ever expanding Web and the information published on it, effective tools for managing such data and presenting information to users based on their needs are becoming nece...
Adel Torkaman Rahmani, B. Hoda Helmi