Sciweavers

2474 search results - page 194 / 495
» Solving Problems on Parallel Computers by Cellular Programmi...
Sort
View
CCE
2004
15 years 6 months ago
Dynamic programming in a heuristically confined state space: a stochastic resource-constrained project scheduling application
The Resource-Constrained Project Scheduling Problem(RCPSP) is a significant challenge in highly regulated industries, such as pharmaceuticals and agrochemicals, where a large numb...
Jaein Choi, Matthew J. Realff, Jay H. Lee
EC
1998
112views ECommerce» more  EC 1998»
15 years 6 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
CSB
2003
IEEE
135views Bioinformatics» more  CSB 2003»
15 years 11 months ago
Stepping Up the Pace of Discovery: the Genomes to Life Program
Genomes to Life (GTL), the U.S. Department of Energy Office of Science’s systems biology program, focuses on environmental microbiology. Over the next 10 to 20 years, GTL’s ke...
Marvin Frazier, David Thomassen, Aristides Patrino...
ICLP
1997
Springer
15 years 10 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
JMLR
2010
115views more  JMLR 2010»
15 years 4 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...