Sciweavers

1086 search results - page 53 / 218
» Programming by Numbers: A Programming Method for Novices
Sort
View
CONSTRAINTS
2000
96views more  CONSTRAINTS 2000»
15 years 1 months ago
A Comparison of Traditional and Constraint-based Heuristic Methods on Vehicle Routing Problems with Side Constraints
The vehicle routing problem (VRP) is a variant of the familiar travelling salesperson problem (TSP). In the VRP we are to perform a number of visits, using a number of vehicles of ...
Philip Kilby, Patrick Prosser, Paul Shaw
APLAS
2005
ACM
15 years 7 months ago
Transformation to Dynamic Single Assignment Using a Simple Data Flow Analysis
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
Peter Vanbroekhoven, Gerda Janssens, Maurice Bruyn...
AUTOMATICA
2007
72views more  AUTOMATICA 2007»
15 years 2 months ago
A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
ust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x,...
Giuseppe C. Calafiore, Fabrizio Dabbene
MEMOCODE
2003
IEEE
15 years 7 months ago
Exact Runtime Analysis Using Automata-Based Symbolic Simulation
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
Tobias Schüle, Klaus Schneider
APCCM
2006
15 years 3 months ago
Postmodern prospects for conceptual modelling
A number of recent developments in software engineering -- from agile methods to aspect-oriented programming to design patterns to good enough software -- share a number of common...
James Noble, Robert Biddle