Sciweavers

2503 search results - page 290 / 501
» A study of 3-arc graphs
Sort
View
HICSS
2002
IEEE
212views Biometrics» more  HICSS 2002»
15 years 11 months ago
Connectivity-Based k-Hop Clustering in Wireless Networks
Abstract. In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and forma...
Geng Chen, Fabian Garcia Nocetti, Julio Solano-Gon...
FUN
2010
Springer
238views Algorithms» more  FUN 2010»
15 years 11 months ago
Mapping an Unfriendly Subway System
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
Paola Flocchini, Matthew Kellett, Peter C. Mason, ...
GECCO
2009
Springer
15 years 10 months ago
Using simulated annealing for producing software architectures
Automatic design of software architecture by use of genetic algorithms has already been shown to be feasible. A natural problem is to augment – if not replace – genetic algori...
Outi Räihä, Erkki Mäkinen, Timo Por...
SIGCSE
2000
ACM
193views Education» more  SIGCSE 2000»
15 years 10 months ago
Experimentation with bounded buffer synchronization
Undergraduates are usually introduced to synchronization in operating systems through a discussion of classical problems such as reader-writer or producers-consumers. The traditio...
Steven Robbins
ECAI
2000
Springer
15 years 10 months ago
Incremental Forward Checking for the Disjunctive Temporal Problem
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
Angelo Oddi, Amedeo Cesta