882 search results - page 85 / 177 » Local Search for Very Large SAT Problems |
134
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
159
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
135
click to vote
ICPP
2006
IEEE
15 years 10 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
108
click to vote
IAT
2009
IEEE
15 years 10 months ago
2009
IEEE
Distributed Partially Observable Markov Decision Problems (DisPOMDPs) are emerging as a popular approach for modeling sequential decision making in teams operating under uncertain...
136
click to vote
JCDL
2005
ACM
15 years 9 months ago
2005
ACM
Constructing a Chinese digital library, especially for a historical article archiving, is often bothered by the small character sets supported by the current computer systems. Thi...