Sciweavers

1816 search results - page 157 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
AIPS
2008
15 years 8 months ago
Learning Heuristic Functions through Approximate Linear Programming
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
Marek Petrik, Shlomo Zilberstein
AIPS
2011
14 years 10 months ago
Effective Heuristics and Belief Tracking for Planning with Incomplete Information
Conformant planning can be formulated as a path-finding problem in belief space where the two main challenges are the heuristics to guide the search, and the representation and u...
Alexandre Albore, Miquel Ramírez, Hector Ge...
IPM
2002
106views more  IPM 2002»
15 years 6 months ago
A feature mining based approach for the classification of text documents into disjoint classes
This paper proposes a new approach for classifying text documents into two disjoint classes. The new approach is based on extracting patterns, in the form of two logical expressio...
Salvador Nieto Sánchez, Evangelos Triantaph...
EMO
2006
Springer
170views Optimization» more  EMO 2006»
15 years 10 months ago
Robust Multi-Objective Optimization in High Dimensional Spaces
1 In most real world optimization problems several optimization goals have to be considered in parallel. For this reason, there has been a growing interest in Multi-Objective Optim...
André Sülflow, Nicole Drechsler, Rolf ...
BMCBI
2008
112views more  BMCBI 2008»
15 years 6 months ago
A simplified approach to disulfide connectivity prediction from protein sequences
Background: Prediction of disulfide bridges from protein sequences is useful for characterizing structural and functional properties of proteins. Several methods based on differen...
Marc Vincent, Andrea Passerini, Matthieu Labb&eacu...