6740 search results - page 958 / 1348 » An s -Hamiltonian Line Graph Problem |
174
click to vote
COMPGEOM
1994
ACM
15 years 11 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
150
click to vote
ICLP
1990
Springer
15 years 11 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
188
click to vote
EDOC
2007
IEEE
15 years 10 months ago
2007
IEEE
The decentralized process of configuring enterprise applications is complex and error-prone, involving multiple participants/roles and numerous configuration changes across multipl...
143
click to vote
CSFW
2010
IEEE
15 years 10 months ago
2010
IEEE
—Anonymous communication protocols must achieve two seemingly contradictory goals: privacy (informally, they must guarantee the anonymity of the parties that send/receive informa...
173
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problems of straightening polygonal trees and convexifying polygons by continuous motions such that rigid edges can rotate around vertex joints and no edge crossing...