Sciweavers

692 search results - page 60 / 139
» Some research questions for computational transportation sci...
Sort
View
COCO
1990
Springer
50views Algorithms» more  COCO 1990»
15 years 2 months ago
Width-Bounded Reducibility and Binary Search over Complexity Classes
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...
Eric Allender, Christopher B. Wilson
CAISE
2004
Springer
15 years 1 months ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...
LATINCRYPT
2010
14 years 8 months ago
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...
HICSS
2003
IEEE
140views Biometrics» more  HICSS 2003»
15 years 3 months ago
Earning a Living among Peers - the Quest for viable P2P Revenue Models
P2P applications have found a lot of interest lately but there are open questions about the viability of the revenue models behind P2P applications/ services. In this paper, we di...
Thomas Hummel, Øyvind Strømme, Ryan ...
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
15 years 4 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...