277 search results - page 52 / 56 » Israel |
CAL
2008
13 years 7 months ago
2008
Network-on-Chips (NoCs) outperform buses in terms of scalability, parallelism and system modularity and therefore are considered as the main interconnect infrastructure in future c...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
BMCBI
2007
13 years 7 months ago
2007
Background: A finite state machine manipulating information-carrying DNA strands can be used to perform autonomous molecular-scale computations at the cellular level. Results: We ...
IJRR
2008
13 years 7 months ago
2008
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
SIGECOM
2008
ACM
13 years 7 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...