Sciweavers

3946 search results - page 391 / 790
» The computational complexity of choice sets
Sort
View
SOUPS
2005
ACM
16 years 1 months ago
Developing privacy guidelines for social location disclosure applications and services
In this article, we describe the design process of Reno, a location-enhanced, mobile coordination tool and person finder. The design process included three field experiments: a ...
Giovanni Iachello, Ian E. Smith, Sunny Consolvo, M...
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
16 years 1 months ago
Parameterized versus generative representations in structural design: an empirical comparison
Any computational approach to design, including the use of evolutionary algorithms, requires the transformation of the domain-specific knowledge into a formal design representatio...
Rafal Kicinger, Tomasz Arciszewski, Kenneth A. De ...
BIRTHDAY
2004
Springer
16 years 1 months ago
A Trace Semantics for Long-Running Transactions
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
Michael J. Butler, C. A. R. Hoare, Carla Ferreira
PAM
2004
Springer
16 years 28 days ago
Measurements and Laboratory Simulations of the Upper DNS Hierarchy
Given that the global DNS system, especially at the higher root and top-levels, experiences significant query loads, we seek to answer the following questions: (1) How does the ch...
Duane Wessels, Marina Fomenkov, Nevil Brownlee, Ki...
CASES
2003
ACM
15 years 11 months ago
A hierarchical approach for energy efficient application design using heterogeneous embedded systems
Several features such as reconfiguration, voltage and frequency scaling, low-power operating states, duty-cycling, etc. are exploited for latency and energy efficient application ...
Sumit Mohanty, Viktor K. Prasanna