Sciweavers

452 search results - page 18 / 91
» Finding bugs is easy
Sort
View
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
14 years 2 months ago
MRBUG: A Competitive Multi-Robot Path Finding Algorithm
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
FUIN
2008
103views more  FUIN 2008»
13 years 8 months ago
LDYIS: a Framework for Model Checking Security Protocols
We present a formalism for the automatic verification of security protocols based on multi-agent systems semantics. We give the syntax and semantics of a temporal-epistemic securit...
Alessio Lomuscio, Wojciech Penczek
TACAS
1998
Springer
131views Algorithms» more  TACAS 1998»
14 years 4 days ago
Detecting Races in Relay Ladder Logic Programs
Relay Ladder Logic (RLL) [4] is a programming language widely used for complex embedded control applications such as manufacturing and amusement park rides. The cost of bugs in RLL...
Alexander Aiken, Manuel Fähndrich, Zhendong S...
WWW
2001
ACM
14 years 8 months ago
Finding Related Web Pages Based on Connectivity Information from a Search Engine
This paper proposes a method for finding related Web pages based on connectivity information of hyperlinks. As claimed by Kumar, a complete bipartite graph of Web pages can be reg...
Tsuyoshi Murata
BIRD
2008
Springer
177views Bioinformatics» more  BIRD 2008»
13 years 9 months ago
GENFOCS - A Comparative Tool on Gene Finding with Sensitivity and Specificity
  The  latest  developments  in  DNA  sequencing  tech­  niques paved the way for tremendous increase in bio­  logical databases. Once the whole DNA sequen...
M. A. Lijo Anto, G. Gopakumar, Achuthsankar S. Nai...