Sciweavers

1569 search results - page 215 / 314
» Automated Design Improvement by Example
Sort
View
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
15 years 5 months ago
Approximating connected facility location problems via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
TON
2008
134views more  TON 2008»
15 years 4 months ago
Efficient broadcasting using network coding
Abstract-- We consider the problem of broadcasting in an adhoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Ou...
Christina Fragouli, Jörg Widmer, Jean-Yves Le...
ESE
2000
102views Database» more  ESE 2000»
15 years 3 months ago
Picking the Right Problem Frame-An Empirical Study
Problem frames are a relatively new approach to requirements engineering, promising benefits not only in elicitation but also in subsequent design, by allowing their users to selec...
Keith Phalp, Karl Cox
IUI
2009
ACM
16 years 28 days ago
Context-based page unit recommendation for web-based sensemaking tasks
Sensemaking tasks require users to perform complex research behaviors to gather and comprehend information from many sources. Such tasks are common and include, for example, resea...
Wen-Huang Cheng, David Gotz
ICSM
2009
IEEE
15 years 10 months ago
Modularizing error recovery
Error recovery is an integral concern in compilers. Improving error recovery requires comprehension of a large and complex code base, in order to locate the places which raise err...
Jeeva Paudel, Christopher Dutchyn