Sciweavers

218 search results - page 24 / 44
» Case Study of Feature Location Using Dependence Graph
Sort
View
89
Voted
DM
2008
103views more  DM 2008»
14 years 12 months ago
Edge-colorings avoiding rainbow and monochromatic subgraphs
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...
Maria Axenovich, Perry Iverson
MOBIHOC
2010
ACM
14 years 9 months ago
Spectrum pricing games with bandwidth uncertainty and spatial reuse in cognitive radio networks
In cognitive radio networks (CRN), primary users can lease out their unused bandwidth to secondary users in return for a fee. We study price competition in a CRN with multiple pri...
Gaurav S. Kasbekar, Saswati Sarkar
PLDI
2010
ACM
15 years 9 months ago
Breadcrumbs: Efficient Context Sensitivity for Dynamic Bug Detection Analyses
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
Michael D. Bond, Graham Z. Baker, Samuel Z. Guyer
WG
2010
Springer
14 years 10 months ago
Network Exploration by Silent and Oblivious Robots
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
Jérémie Chalopin, Paola Flocchini, B...
ISJ
2002
212views more  ISJ 2002»
14 years 11 months ago
Assessing and managing the benefits of enterprise systems: the business manager's perspective
This paper focuses on the benefits that organizations may achieve from their investment in enterprise systems (ES). It proposes an ES benefit framework for summarizing benefits in ...
Shari Shang, Peter B. Seddon