Sciweavers

373 search results - page 52 / 75
» Counting in Trees for Free
Sort
View
ICML
2005
IEEE
14 years 9 months ago
Exploiting syntactic, semantic and lexical regularities in language modeling via directed Markov random fields
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
Shaojun Wang, Shaomin Wang, Russell Greiner, Dale ...
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
14 years 2 months ago
Learning building block structure from crossover failure
In the classical binary genetic algorithm, although crossover within a building block (BB) does not always cause a decrease in fitness, any decrease in fitness results from the ...
Zhenhua Li, Erik D. Goodman
SAT
2004
Springer
73views Hardware» more  SAT 2004»
14 years 2 months ago
A SAT Based Scheduler for Tournament Schedules
We present a scheduler with a web interface for generating fair game schedules of a tournament. The tournament can be either single or double round-robin or something in between. T...
Hantao Zhang, Dapeng Li, Haiou Shen
DSN
2004
IEEE
14 years 12 days ago
Robust Aggregation Protocols for Large-Scale Overlay Networks
Aggregation refers to a set of functions that provide global information about a distributed system. These functions operate on numeric values distributed over the system and can ...
Alberto Montresor, Márk Jelasity, Özal...
CONCURRENCY
2010
110views more  CONCURRENCY 2010»
13 years 8 months ago
Redesigning the message logging model for high performance
Over the past decade the number of processors in the high performance facilities went up to hundreds of thousands. As a direct consequence, while the computational power follow th...
Aurelien Bouteiller, George Bosilca, Jack Dongarra