Sciweavers

3250 search results - page 111 / 650
» An Algorithm to Solve a Linear Program
Sort
View
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
15 years 3 months ago
Ant Colony Programming for Approximation Problems
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wiec...
INFOCOM
2012
IEEE
13 years 8 days ago
Strategizing surveillance for resource-constrained event monitoring
—Surveillance systems, such as sensor networks and surveillance camera networks, have been widely deployed to monitor events in many different scenarios. One common way to conser...
Xi Fang, Dejun Yang, Guoliang Xue
MP
2008
117views more  MP 2008»
14 years 9 months ago
Stochastic programming approach to optimization under uncertainty
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...
Alexander Shapiro
POPL
2010
ACM
15 years 4 months ago
Compress-and-conquer for optimal multicore computing
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
Zhijing G. Mou, Hai Liu, Paul Hudak
MICCAI
2004
Springer
15 years 10 months ago
Solving Incrementally the Fitting and Detection Problems in fMRI Time Series
We tackle the problem of real-time statistical analysis of functional magnetic resonance imaging (fMRI) data. In a recent paper, we proposed an incremental algorithm based on the e...
Alexis Roche, Philippe Pinel, Stanislas Dehaene, J...