Sciweavers

2712 search results - page 441 / 543
» Sequence Comparison Using a Relational Database Approach
Sort
View
ICNC
2005
Springer
15 years 8 months ago
DNA Computing for Complex Scheduling Problem
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
Mohd Saufee Muhammad, Zuwairie Ibrahim, Satomi Ued...
CHI
1997
ACM
15 years 6 months ago
Revisitation Patterns in World Wide Web Navigation
In this paper, we report on users' revisitation patterns to World Wide Web (WWW) pages, and use the results to lay an empirical foundation for the design of history mechanism...
Linda Tauscher, Saul Greenberg
114
Voted
LOGCOM
2007
97views more  LOGCOM 2007»
15 years 2 months ago
A General Framework for Expressing Preferences in Causal Reasoning and Planning
We consider the problem of incorporating arbitrary preferences in planning systems. A preference may be seen as a goal or constraint that is desirable, but not necessary, to satis...
James P. Delgrande, Torsten Schaub, Hans Tompits
87
Voted
CSFW
2009
IEEE
15 years 9 months ago
Minimal Message Complexity of Asynchronous Multi-party Contract Signing
Multi-party contract signing protocols specify how a number of signers can cooperate in achieving a fully signed contract, even in the presence of dishonest signers. This problem h...
Sjouke Mauw, Sasa Radomirovic, Mohammad Torabi Das...
ISCAS
1999
IEEE
106views Hardware» more  ISCAS 1999»
15 years 6 months ago
Test pattern generation for width compression in BIST
The main objectives of Built-In Self Test (BIST) are the design of test pattern generator circuits which achieve the highest fault coverage, require the shortest sequence of test ...
Paulo F. Flores, Horácio C. Neto, K. Chakra...