Author name cluster

Alon Levy

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers

1 author row

AAMAS Conference 2010 Conference Paper

Ants Meeting Algorithms

Asaf Shiloni
Alon Levy
Ariel Felner
Meir Kalech

Ant robots have very low computational power and limited memory. Theycommunicate by leaving pheromones in the environment. In order to createa cooperative intelligent behavior, ants may need to get together; however, they may not know the locations of other ants. Hence, we focus on an antvariant of the rendezvous problem, in which two ants are to be brought tothe same location in finite time. We introduce two algorithms that solvethis problem for two ants by simulating a bidirectional search in differentenvironment settings. An algorithm for an environment with no obstaclesand a general algorithm that handles all types of obstacles. We providedetailed discussion on the different attributes, size of pheromone required, and the performance of these algorithms.

PDF

AAAI Conference 1999 Conference Paper

Navigational Plans for Data Integration

Marc Friedman
Alon Levy
Todd Millstein
University of Washington

Weconsider the problemof building data integration systems whenthe data sources are websof data, rather than sets of relations. Previousapproachesto modeling data sources axe inappropriate in this context because they do not capture the relationships betweenlinked data and the need to navigate through paths in the data source in order to obtain the data. Wedescribe a languagefor modelingdata sources in this newcontext. Weshowthat our language has the required expressive power, and that minor extensions to it would makequery answeringintractable. Weprovide a sound and completealgorithm for reformulating a user query into a query over the data sources, and we showhow to create query execution plans that both query and navigate the data sources.

PDF Details

IJCAI Conference 1999 Conference Paper

Verifying Integrity Constraints on Web Sites

Mary Ferndndez
Daniela Florescu
Alon Levy
Dan Suciu

Data-intensive Web sites have created a new form of knowledge base, as richly structured bodies of data. Several novel systems for creating dataintensive Web sites support declarative specification of a site's structure and content (i. e. , the pages, the data available in each page, and the links between pages). Declarative systems provide a platform on which A1 techniques can be developed that, further simplify the tasks of constructing and maintaining Web sites. This paper addresses the problem of specifying and verifying integrity constraints on a Web site's structure. We describe a language that can capture many practical constraints and an accompanying sound and complete verification algorithm. The algorithm has the important property that if the constraints are violated, it proposes fixes to either the constraints or to the site definition. Finally, we establish tight bounds on the complexity of the verification problem we consider.

PDF