Sciweavers

2365 search results - page 148 / 473
» All things are connected
Sort
View
COMPGEOM
1997
ACM
15 years 10 months ago
The Area Bisectors of a Polygon and Force Equilibria in Programmable Vector Fields
We consider the family of area bisectors of a polygon possibly with holes in the plane. We say that two bisectors of a polygon P are combinatorially distinct if they induce di e...
Karl-Friedrich Böhringer, Bruce Randall Donal...
COMPGEOM
1990
ACM
15 years 10 months ago
Minimum-Link Paths Among Obstacles in the Plane
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
Joseph S. B. Mitchell, Günter Rote, Gerhard J...
COMPGEOM
2004
ACM
15 years 10 months ago
Intersecting quadrics: an efficient and exact implementation
We present the first complete, exact, and efficient C++ implementation for parameterizing the intersection of two implicit quadrics with integer coefficients of arbitrary size. It...
Sylvain Lazard, Luis Mariano Peñaranda, Syl...
CCIA
2006
Springer
15 years 10 months ago
Extending the BDI architecture with commitments
Abstract. In this paper, we describe a novel agent architecture for normative multiagent systems which is based on multi-context systems. It models the three modalities of Rao and ...
Dorian Gaertner, Pablo Noriega, Carles Sierra
STRINGOLOGY
2008
15 years 8 months ago
The Road Coloring and Cerny Conjecture
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
Avraham Trahtman