5473 search results - page 815 / 1095 » On the graph isomorphism problem |
159
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...
143
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...
160
Voted
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 ...
178
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...
172
click to vote
ICCAD
2000
IEEE
15 years 11 months ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...