2905 search results - page 291 / 581 » Formal Memetic Algorithms |
IJCNLP
2004
Springer
15 years 4 months ago
2004
Springer
We study the problem of efficiently removing equal frequency n-gram substrings from an n-gram set, formally called Statistical Substring Reduction (SSR). SSR is a useful operatio...
CODES
2003
IEEE
15 years 4 months ago
2003
IEEE
Current methods cannot synthesize real-time embedded software applications when the global deadline of a task is shorter than the total of all local deadlines along a critical pat...
INFOCOM
2003
IEEE
15 years 4 months ago
2003
IEEE
— Knowledge of the up-to-date physical (i.e., layer-2) topology of an Ethernet network is crucial to a number of critical network management tasks, including reactive and proacti...
SIGECOM
2003
ACM
15 years 4 months ago
2003
ACM
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
101
click to vote
POPL
1998
ACM
15 years 3 months ago
1998
ACM
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...