Sciweavers

3378 search results - page 586 / 676
» A universe of binding and computation
Sort
View
FOCS
2005
IEEE
15 years 3 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
NDSS
2005
IEEE
15 years 3 months ago
One-Way Isolation: An Effective Approach for Realizing Safe Execution Environments
In this paper, we present an approach for realizing a safe execution environment (SEE) that enables users to “try out” new software (or configuration changes to existing soft...
Weiqing Sun, Zhenkai Liang, V. N. Venkatakrishnan,...
SENSYS
2005
ACM
15 years 3 months ago
A unifying link abstraction for wireless sensor networks
ng Link Abstraction for Wireless Sensor Networks Joseph Polastre, Jonathan Hui, Philip Levis, Jerry Zhao, David Culler, Scott Shenker, and Ion Stoica Computer Science Department In...
Joseph Polastre, Jonathan Hui, Philip Levis, Jerry...
BIRTHDAY
2005
Springer
15 years 3 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
DIGRA
2005
Springer
15 years 3 months ago
Beyond P-1: Who Plays Online?
Academics and industry professionals alike have long been interested in developing a nuanced and empirically sound typography of online gamers. Designers and engineers are aware o...
Avery Alix