Sciweavers

3250 search results - page 402 / 650
» An Algorithm to Solve a Linear Program
Sort
View
SIGSOFT
1995
ACM
15 years 10 months ago
Precise Interprocedural Chopping
The notion of a program slice, originally introduced by Mark Weiser, is a fundamental operation for addressing many software-engineering problems, including program understanding,...
Thomas W. Reps, Genevieve Rosay
WOB
2003
140views Bioinformatics» more  WOB 2003»
15 years 8 months ago
Computing Maximum Subsequence in Parallel
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
Carlos E. R. Alves, Edson Cáceres, Siang W....
ATAL
2006
Springer
15 years 10 months ago
ACTIVE: agile coordinator testbed integrated virtual environment
This paper describes the specification, design and development of ACTIVE, a testbed for the testing and simulation of large-scale agent-based systems. ACTIVE is being developed as...
G. Emami, J. Cheng, D. Cornwell, M. Feldhousen, C....
JMLR
2006
108views more  JMLR 2006»
15 years 6 months ago
The Interplay of Optimization and Machine Learning Research
The fields of machine learning and mathematical programming are increasingly intertwined. Optimization problems lie at the heart of most machine learning approaches. The Special T...
Kristin P. Bennett, Emilio Parrado-Hernánde...
MFCS
2005
Springer
16 years 1 days ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta