Sciweavers

1597 search results - page 153 / 320
» A Design Method for Object-Oriented Programming
Sort
View
MOR
2002
94views more  MOR 2002»
15 years 2 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
EUROGP
2005
Springer
115views Optimization» more  EUROGP 2005»
15 years 8 months ago
Genetic Programming in Wireless Sensor Networks
Abstract. Wireless sensor networks (WSNs) are medium scale manifestations of a paintable or amorphous computing paradigm. WSNs are becoming increasingly important as they attain gr...
Derek M. Johnson, Ankur Teredesai, Robert T. Salta...
EUROSYS
2011
ACM
14 years 6 months ago
Striking a new balance between program instrumentation and debugging time
Although they are helpful in many cases, state-of-the-art bug reporting systems may impose excessive overhead on users, leak private information, or provide little help to the dev...
Olivier Crameri, Ricardo Bianchini, Willy Zwaenepo...
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
16 years 4 months ago
How to Determine a Good Multi-Programming Level for External Scheduling
Scheduling/prioritization of DBMS transactions is important for many applications that rely on database backends. A convenient way to achieve scheduling is to limit the number of ...
Bianca Schroeder, Mor Harchol-Balter, Arun Iyengar...
GPEM
2008
128views more  GPEM 2008»
15 years 3 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood