Sciweavers

1559 search results - page 189 / 312
» Fundamentals of Generic Programming
Sort
View
ICSE
2000
IEEE-ACM
15 years 1 months ago
Software economics: a roadmap
The fundamental goal of all good design and engineering is to create maximal value added for any given investment. There are many dimensions in which value can be assessed, from m...
Barry W. Boehm, Kevin J. Sullivan
CORR
2008
Springer
77views Education» more  CORR 2008»
14 years 10 months ago
Energy-efficient Scheduling of Delay Constrained Traffic over Fading Channels
Abstract--A delay-constrained scheduling problem for pointto-point communication is considered: a packet of B bits must be transmitted by a hard deadline of T slots over a timevary...
Juyul Lee, Nihar Jindal
FAC
2008
108views more  FAC 2008»
14 years 10 months ago
Property-directed incremental invariant generation
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance analysis, in which one proves that an assertion holds on all reachable states. Typ...
Aaron R. Bradley, Zohar Manna
JMMA
2002
90views more  JMMA 2002»
14 years 9 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...
EOR
2011
113views more  EOR 2011»
14 years 4 months ago
A relation-algebraic approach to simple games
Simple games are a powerful tool to analyze decision-making and coalition formation in social and political life. In this paper, we present relation-algebraic models of simple game...
Rudolf Berghammer, Stefan Bolus, Agnieszka Rusinow...