4009 search results - page 733 / 802 » Clustering on Complex Graphs |
126
click to vote
KBS
2007
15 years 4 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
124
click to vote
IVC
2000
15 years 4 months ago
2000
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
134
click to vote
SIAMCOMP
2000
15 years 4 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
151
click to vote
ASE
1999
15 years 4 months ago
1999
Behaviour analysis should form an integral part of the software development process. This is particularly important in the design of concurrent and distributed systems, where comp...
127
click to vote
JSA
1998
15 years 3 months ago
1998
In this paper, we present a network conscious approach to designing distributed real-time systems. Given a task graph design of the system, the end-to-end constraints on the input...