Sciweavers

1692 search results - page 314 / 339
» Applying Science Models for Search
Sort
View
ATVA
2004
Springer
146views Hardware» more  ATVA 2004»
14 years 2 months ago
A Global Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...
Tadaaki Tanimoto, Suguru Sasaki, Akio Nakata, Teru...
HICSS
2003
IEEE
114views Biometrics» more  HICSS 2003»
14 years 1 months ago
Duration in the Digital Economy
We examine the drivers of Internet firm survival using a multi-method survival analysis. Based on previous literature on business failure and recent IS research on e-commerce busi...
Robert J. Kauffman, Bin Wang
MOBIHOC
2003
ACM
14 years 1 months ago
PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems
Reliable storage of data with concurrent read/write accesses (or query/update) is an ever recurring issue in distributed settings. In mobile ad hoc networks, the problem becomes e...
Jun Luo, Jean-Pierre Hubaux, Patrick Th. Eugster
KDD
1999
ACM
128views Data Mining» more  KDD 1999»
14 years 27 days ago
Towards Automated Synthesis of Data Mining Programs
Code synthesis is routinely used in industry to generate GUIs, form lling applications, and database support code and is even used with COBOL. In this paper we consider the questi...
Wray L. Buntine, Bernd Fischer 0002, Thomas Pressb...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
14 years 22 days ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts