Sciweavers

2043 search results - page 113 / 409
» Some Basics on Tolerances
Sort
View
JUCS
2002
110views more  JUCS 2002»
15 years 6 months ago
Generation of Constants and Synchronization of Finite Automata
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
Arto Salomaa
CHI
2008
ACM
16 years 6 months ago
The buzz: supporting user tailorability in awareness applications
Information awareness applications offer the exciting potential to help people to better manage the data they encounter on a routine basis, but customizing these applications is a...
James R. Eagan, John T. Stasko
CADE
2002
Springer
16 years 6 months ago
The Quest for Efficient Boolean Satisfiability Solvers
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
Lintao Zhang, Sharad Malik
TRIDENTCOM
2008
IEEE
16 years 24 days ago
A quantitative evaluation of the MeshTest wireless testbed
The MeshTest testbed is designed to subject wireless devices and protocols to realistic and repeatable mobile scenarios, including multi-hop and disconnected topologies. The testb...
Brenton Walker, Charles Clancy
SPW
2005
Springer
15 years 12 months ago
Enhancing Privacy with Shared Pseudo Random Sequences
Protecting users’ privacy is essential for turning networks and services into trustworthy friends. Many privacy enhancing techniques, such as anonymous e-cash and mix-nets, have...
Jari Arkko, Pekka Nikander, Mats Näslund