Sciweavers

3228 search results - page 584 / 646
» Basics of Compiler Design
Sort
View
FOCS
2000
IEEE
15 years 4 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
AGENTS
2000
Springer
15 years 3 months ago
Towards a fault-tolerant multi-agent system architecture
Multi-agent systems are prone to failures typical of any distributed system. Agents and resources may become unavailable due to machine crashes, communication breakdowns, process ...
Sanjeev Kumar, Philip R. Cohen
DATE
1998
IEEE
91views Hardware» more  DATE 1998»
15 years 3 months ago
Interconnect Tuning Strategies for High-Performance Ics
Interconnect tuning is an increasingly critical degree of freedom in the physical design of high-performance VLSI systems. By interconnect tuning, we refer to the selection of lin...
Andrew B. Kahng, Sudhakar Muddu, Egino Sarto, Rahu...
ROBOCUP
1999
Springer
113views Robotics» more  ROBOCUP 1999»
15 years 3 months ago
Middle Sized Soccer Robots: ARVAND
Abstract. Arvand is the name of robots specially designed and constructed by sharif CE team for playing soccer according to RoboCup rules and regulations for the middle size robots...
Mansour Jamzad, Amirali Foroughnassiraei, Ehsan Ch...
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 3 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers