Sciweavers

102 search results - page 18 / 21
» A Stochastic Local Search Approach to Vertex Cover
Sort
View
BMCBI
2005
121views more  BMCBI 2005»
13 years 7 months ago
Automated methods of predicting the function of biological sequences using GO and BLAST
Background: With the exponential increase in genomic sequence data there is a need to develop automated approaches to deducing the biological functions of novel sequences with hig...
Craig E. Jones, Ute Baumann, Alfred L. Brown
JMLR
2006
124views more  JMLR 2006»
13 years 8 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos
AI
2002
Springer
13 years 7 months ago
The size distribution for Markov equivalence classes of acyclic digraph models
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
Steven B. Gillispie, Michael D. Perlman
IAT
2006
IEEE
14 years 2 months ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...
HAIS
2009
Springer
14 years 16 days ago
Evolutionary Non-linear Great Deluge for University Course Timetabling
This paper presents a hybrid evolutionary algorithm to tackle university course timetabling problems. The proposed approach is an extension of a non-linear great deluge algorithm i...
Dario Landa Silva, Joe Henry Obit