Sciweavers

1356 search results - page 58 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
IJDMB
2010
128views more  IJDMB 2010»
13 years 6 months ago
Computing approximate solutions of the protein structure determination problem using global constraints on discrete crystal latt
: Crystal lattices are discrete models of the three-dimensional space that have been effectively employed to facilitate the task of determining proteins' natural conformation....
Alessandro Dal Palù, Agostino Dovier, Enric...
JSAT
2006
109views more  JSAT 2006»
13 years 9 months ago
Decomposing SAT Problems into Connected Components
Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This o...
Armin Biere, Carsten Sinz
IJCAI
2003
13 years 10 months ago
Generalizing Plans to New Environments in Relational MDPs
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
Carlos Guestrin, Daphne Koller, Chris Gearhart, Ne...
CEC
2005
IEEE
14 years 2 months ago
A model-based evolutionary algorithm for bi-objective optimization
Abstract- The Pareto optimal solutions to a multiobjective optimization problem often distribute very regularly in both the decision space and the objective space. Most existing ev...
Aimin Zhou, Qingfu Zhang, Yaochu Jin, Edward P. K....
APWEB
2006
Springer
14 years 1 months ago
A New Methodology for Information Presentations on the Web
Abstract. The rapid growth of on-line information including multimedia contents during the last decade caused a major problem for Web users - there is too much information availabl...
Hyun Woong Shin, Dennis McLeod, Larry Pryor