Sciweavers

352 search results - page 66 / 71
» Problem section
Sort
View
144
Voted
DAC
1994
ACM
15 years 7 months ago
Exact Minimum Cycle Times for Finite State Machines
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...
William K. C. Lam, Robert K. Brayton, Alberto L. S...
181
Voted
ESAS
2004
Springer
15 years 7 months ago
Advanced Detection of Selfish or Malicious Nodes in Ad Hoc Networks
Abstract. The fact that security is a critical problem when implementing mobile ad hoc networks (MANETs) is widely acknowledged. One of the different kinds of misbehavior a node ma...
Frank Kargl, Andreas Klenk, Stefan Schlott, Michae...
161
Voted
ASPLOS
2008
ACM
15 years 5 months ago
General and efficient locking without blocking
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...
Yannis Smaragdakis, Anthony Kay, Reimer Behrends, ...
151
Voted
CIKM
2008
Springer
15 years 5 months ago
Intra-document structural frequency features for semi-supervised domain adaptation
In this work we try to bridge the gap often encountered by researchers who find themselves with few or no labeled examples from their desired target domain, yet still have access ...
Andrew Arnold, William W. Cohen
123
Voted
COCOON
2008
Springer
15 years 5 months ago
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete
The problem of determining haplotypes from genotypes has gained considerable prominence in the research community since the beginning of the HapMap project. Here the focus is on de...
Arvind Gupta, Ján Manuch, Ladislav Stacho, ...