6740 search results - page 1029 / 1348 » An s -Hamiltonian Line Graph Problem |
188
click to vote
COLT
2003
Springer
16 years 8 hour ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
165
click to vote
DSN
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the following problem for wireless ad hoc networks: assume n nodes, each capable of communicating with nodes within a radius of r, are distributed in a ddimensional re...
149
click to vote
ICSE
2010
IEEE-ACM
15 years 11 months ago
2010
IEEE-ACM
Large-scale software engineering requires communication and collaboration to successfully build and ship products. We conducted a survey with Microsoft engineers on inter-team coo...
165
click to vote
FM
2009
Springer
15 years 11 months ago
2009
Springer
The problem of enforcing bounded-time 2-phase recovery in real-time programs is often necessitated by conflict between faulttolerance requirements and timing constraints. In this ...
182
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...