Sciweavers

1055 search results - page 126 / 211
» Enumerations in computable structure theory
Sort
View
TLDI
2009
ACM
111views Formal Methods» more  TLDI 2009»
14 years 7 months ago
A generic type-and-effect system
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Daniel Marino, Todd D. Millstein
SAGT
2009
Springer
113views Game Theory» more  SAGT 2009»
14 years 4 months ago
Games with Congestion-Averse Utilities
Congestion games—in which players strategically choose from a set of “resources” and derive utilities that depend on the congestion on each resource— are important in a wid...
Andrew Byde, Maria Polukarov, Nicholas R. Jennings
INDIASE
2009
ACM
14 years 4 months ago
An effective learning environment for teaching problem solving in software architecture
A software architect engages in solving Software Engineering (SE) problems throughout his career. Thus inculcating problem solving skills should be one of the learning objectives ...
Kirti Garg, Vasudeva Varma
INFOCOM
2008
IEEE
14 years 4 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
GLVLSI
2007
IEEE
187views VLSI» more  GLVLSI 2007»
14 years 4 months ago
DAG based library-free technology mapping
This paper proposes a library-free technology mapping algorithm to reduce delay in combinational circuits. The algorithm reduces the overall number of series transistors through t...
Felipe S. Marques, Leomar S. da Rosa Jr., Renato P...