3113 search results - page 305 / 623 » Efficiently Generating Efficient Generating Extensions in Pr... |
159
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
172
click to vote
EC
2006
15 years 4 months ago
2006
Learning Classifier Systems (LCSs), such as the accuracy-based XCS, evolve distributed problem solutions represented by a population of rules. During evolution, features are speci...
143
Voted
ICCAD
2006
IEEE
16 years 1 months ago
2006
IEEE
A dynamically reconfigurable processor (DRP) is designed to achieve high area efficiency by switching reconfigurable data paths dynamically. Our DRP architecture has a stand alone...
152
click to vote
CF
2008
ACM
15 years 6 months ago
2008
ACM
Volunteer Computing (VC) is a paradigm that takes advantage of idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale...
141
Voted
AAAI
2000
15 years 6 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...