Israel A. Wagner

According to our database1, Israel A. Wagner authored at least 41 papers between 1993 and 2011.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
Multi-agent Cooperative Cleaning of Expanding Domains.
Int. J. Robotics Res., 2011

2009
Collaborative Exploration in Grid Domains - Constructive Conjecture of a Polynomial Time Complexity.
Proceedings of the ICINCO 2009, 2009

Swarm ant robotics for a dynamic cleaning problem - upper bounds.
Proceedings of the 4th International Conference on Autonomous Robots and Agents, 2009

Swarm ant robotics for a dynamic cleaning problem - analytic lower bounds and impossibility results.
Proceedings of the 4th International Conference on Autonomous Robots and Agents, 2009

2008
A Robust Random Number Generator Based on a Differential Current-Mode Chaos.
IEEE Trans. Very Large Scale Integr. Syst., 2008

Efficient cooperative search of smart targets using UAV Swarms.
Robotica, 2008

Cooperative Cleaners: A Study in Ant Robotics.
Int. J. Robotics Res., 2008

Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts.
Int. J. Robotics Res., 2008

2007
A Linear-Time Constant-Space Algorithm for the Boundary Fill Problem.
Comput. J., 2007

2006
Swarm Intelligence - Searchers, Cleaners and Hunters.
Proceedings of the Swarm Intelligent Systems, 2006

Logic Gates as Repeaters (LGR) for Area-Efficient Timing Optimization.
IEEE Trans. Very Large Scale Integr. Syst., 2006

On Minimal Perimeter Polyminoes.
Proceedings of the Discrete Geometry for Computer Imagery, 13th International Conference, 2006

2005
Swarm robotics for a dynamic cleaning problem.
Proceedings of the 2005 IEEE Swarm Intelligence Symposium, 2005

2004
An efficient implementation of D-Flip-Flop using the GDI technique.
Proceedings of the 2004 International Symposium on Circuits and Systems, 2004

Repeater insertion combined with LGR methodology for on-chip interconnect timing optimization.
Proceedings of the 2004 11th IEEE International Conference on Electronics, 2004

Electromigration-dependent parametric yield estimation.
Proceedings of the 2004 11th IEEE International Conference on Electronics, 2004

Reliability and Yield: A Joint Defect-Oriented Approach.
Proceedings of the 19th IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2004), 2004

Multi-Agent Physical A* Using Large Pheromones.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

Gathering Multiple Robotic A(ge)nts with Limited Sensing Capabilities.
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2004

Large Pheromones: A Case Study with Multi-agent Physical A*.
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2004

2003
A Distributed Ant Algorithm for Efficiently Patrolling a Network.
Algorithmica, 2003

Logic Gates as Repeaters (LGR) for Timing Optimization of SoC Interconnects.
Proceedings of the IFIP VLSI-SoC 2003, 2003

Discrete Bee Dance Algorithms for Pattern Formation on a Grid.
Proceedings of the 2003 IEEE/WIC International Conference on Intelligent Agent Technology (IAT 2003), 2003

On-chip interconnect-aware design and modeling methodology, based on high bandwidth transmission line devices.
Proceedings of the 40th Design Automation Conference, 2003

2002
Gate-diffusion input (GDI): a power-efficient method for digital combinatorial circuits.
IEEE Trans. Very Large Scale Integr. Syst., 2002

Gate-diffusion input (GDI) - a technique for low power design of digital circuits: analysis and characterization.
Proceedings of the 2002 International Symposium on Circuits and Systems, 2002

An Interconnect-Aware Methodology for Analog and Mixed Signal Design, Based on High Bandwidth (Over 40 Ghz) On-Chip Transmission Line Approach .
Proceedings of the 2002 Design, 2002

2001
Vertex-Ant-Walk - A robust method for efficient exploration of faulty graphs.
Ann. Math. Artif. Intell., 2001

From Ants to A(ge)nts: A Special Issue on Ant-Robotics.
Ann. Math. Artif. Intell., 2001

A Novel Method for Stochastic Nonlinearity Analysis of a CMOS Pipeline ADC.
Proceedings of the 38th Design Automation Conference, 2001

2000
MAC Versus PC: Determinism and Randomness as Complementary Approaches to Robotic Exploration of Continuous Unknown Domains.
Int. J. Robotics Res., 2000

ANTS: Agents on Networks, Trees, and Subgraphs.
Future Gener. Comput. Syst., 2000

1999
Distributed covering by ant-robots using evaporating traces.
IEEE Trans. Robotics Autom., 1999

Hamiltonian(t)-an ant-inspired heuristic for recognizing Hamiltonian graphs.
Proceedings of the 1999 Congress on Evolutionary Computation, 1999

1998
Ant robotics: search, exploration and covering in multi-a(ge)nt systems.
PhD thesis, 1998

Efficiently Searching a Graph by a Smell-Oriented Vertex Process.
Ann. Math. Artif. Intell., 1998

Robotic Exploration, Brownian Motion and Electrical Resistance.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

1996
Smell as a Computational Resource - A Lesson We Can Learn from the Ant.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995
The effect of spot defects on the parametric yield of long interconnection lines.
Proceedings of the 1995 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems, 1995

1993
An efficient algorithm for some multirow layout problems.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1993

An Interactive Yield Estimator as a VLSI CAD Tool.
Proceedings of the IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems, 1993


  Loading...