Sciweavers

3775 search results - page 511 / 755
» The Expression Problem Revisited
Sort
View
AIPS
2003
15 years 8 months ago
A Framework for Planning with Extended Goals under Partial Observability
Planning in nondeterministic domains with temporally extended goals under partial observability is one of the most challenging problems in planning. Subsets of this problem have b...
Piergiorgio Bertoli, Alessandro Cimatti, Marco Pis...
BMCBI
2006
136views more  BMCBI 2006»
15 years 6 months ago
EMD: an ensemble algorithm for discovering regulatory motifs in DNA sequences
Background: Understanding gene regulatory networks has become one of the central research problems in bioinformatics. More than thirty algorithms have been proposed to identify DN...
Jianjun Hu, Yifeng D. Yang, Daisuke Kihara
CORR
2006
Springer
132views Education» more  CORR 2006»
15 years 6 months ago
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. ...
BMCBI
2007
153views more  BMCBI 2007»
15 years 6 months ago
A new pairwise kernel for biological network inference with support vector machines
Background: Much recent work in bioinformatics has focused on the inference of various types of biological networks, representing gene regulation, metabolic processes, protein-pro...
Jean-Philippe Vert, Jian Qiu, William Stafford Nob...
CCR
2002
86views more  CCR 2002»
15 years 6 months ago
Hop-by-hop routing algorithms for premium traffic
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
Jun Wang, Klara Nahrstedt