Sciweavers

15777 search results - page 2776 / 3156
» The Reformulation-Optimization Software Engine
Sort
View
FSTTCS
2008
Springer
15 years 5 months ago
Pruning 2-Connected Graphs
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
Chandra Chekuri, Nitish Korula
FSTTCS
2008
Springer
15 years 5 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
CSMR
2007
IEEE
15 years 5 months ago
A Case Study of Defect-Density and Change-Density and their Progress over Time
We have performed an empirical case study, investigating defect-density and change-density of a reusable framework compared with one application reusing it over time at a large Oi...
Anita Gupta, Odd Petter N. Slyngstad, Reidar Conra...
AC
2008
Springer
15 years 5 months ago
Computing with RFID- Drivers, Technology and Implications
Radio Frequency Identification or simply rfid has come to be an integral part of modern computing. Rfid is notable in that it is the first practical technology to tightly couple p...
George Roussos
CACM
2008
131views more  CACM 2008»
15 years 5 months ago
Exterminator: Automatically correcting memory errors with high probability
Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. These errors, which can lead to crashes, erroneous execution, and...
Gene Novark, Emery D. Berger, Benjamin G. Zorn
« Prev « First page 2776 / 3156 Last » Next »