Sciweavers

738 search results - page 64 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
EUC
2006
Springer
15 years 1 months ago
Dynamic Repartitioning of Real-Time Schedule on a Multicore Processor for Energy Efficiency
Multicore processors promise higher throughput at lower power consumption than single core processors. Thus in the near future they will be widely used in hard real-time systems as...
Euiseong Seo, Yongbon Koo, Joonwon Lee
ISCAS
2003
IEEE
126views Hardware» more  ISCAS 2003»
15 years 3 months ago
High-speed processor for quantum-computing emulation and its applications
A high-speed and large-scale processor dedicated to quantum computing is proposed, which has the minimum operation function needed for execution of a quantum algorithm. In this pr...
Minoru Fujishima, Kaoru Saito, M. Onouchi, Koichir...
DAC
2002
ACM
15 years 10 months ago
Solving difficult SAT instances in the presence of symmetry
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
SSR
2001
104views more  SSR 2001»
14 years 11 months ago
Secure and efficient mobile agent application reuse using patterns
As wide-area open networks like the Internet and intranets grow larger, mobile agent technology is attracting more attention. Mobile agents are units of software that can deal wit...
Yasuyuki Tahara, Nobukazu Toshiba, Akihiko Ohsuga,...
PLDI
2006
ACM
15 years 3 months ago
Context-sensitive domain-independent algorithm composition and selection
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...
Troy A. Johnson, Rudolf Eigenmann