Sciweavers

13137 search results - page 2273 / 2628
» A Science of Software Design
Sort
View
MCU
1998
119views Hardware» more  MCU 1998»
15 years 8 months ago
DNA Computing Based on Splicing: Universality Results
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
Gheorghe Paun
CASCON
1996
126views Education» more  CASCON 1996»
15 years 8 months ago
Evaluating the costs of management: a distributed applications management testbed
In today's distributed computing environments, users are makingincreasing demands on the systems, networks, and applications they use. Users are coming to expect performance,...
Michael Katchabaw, Stephen L. Howard, Andrew D. Ma...
DGO
2009
151views Education» more  DGO 2009»
15 years 8 months ago
Making ecology research results useful for resource management: a case study in visual analytics
This paper addresses challenges to resource managers' use of scientific research, and reports strategies and informatics tools to ameliorate those challenges. Our work involv...
Natalie Kopytko, Judith Bayard Cushing, Lee Zeman,...
MOBICOM
2010
ACM
15 years 7 months ago
Privacy vulnerability of published anonymous mobility traces
Mobility traces of people and vehicles have been collected and published to assist the design and evaluation of mobile networks, such as large-scale urban sensing networks. Althou...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
15 years 7 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
« Prev « First page 2273 / 2628 Last » Next »