Sciweavers

2950 search results - page 133 / 590
» Computing with Infinitely Many Processes
Sort
View
FPL
2004
Springer
128views Hardware» more  FPL 2004»
15 years 8 months ago
Design and Implementation of a CFAR Processor for Target Detection
Real-time performance of adaptive digital signal processing algorithms is required in many applications but it often means a high computational load for many conventional processor...
Cesar Torres-Huitzil, René Cumplido-Parra, ...
128
Voted
CEC
2003
IEEE
15 years 7 months ago
Adaptive temperature schedule determined by genetic algorithm for parallel simulated annealing
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
Mitsunori Miki, Tomoyuki Hiroyasu, Jun'ya Wako, Ta...
BMCBI
2006
100views more  BMCBI 2006»
15 years 2 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
90
Voted
ECOOPW
1998
Springer
15 years 6 months ago
Exploiting Architecture in Experimental System Development
This position paper takes as outset experience obtained during development of an object-oriented prototype for a global customer service system. The project involved a large shipp...
Klaus Marius Hansen
99
Voted
CHI
2010
ACM
15 years 9 months ago
On reconstruction of task context after interruption
Theoretical accounts of task resumption after interruption have almost exclusively argued for resumption as a primarily memory-based process. In contrast, for many task domains, r...
Dario D. Salvucci