Sciweavers

5889 search results - page 897 / 1178
» Graph Layout Problems
Sort
View
ICSE
2010
IEEE-ACM
15 years 11 months ago
Codebook: discovering and exploiting relationships in software repositories
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...
Andrew Begel, Yit Phang Khoo, Thomas Zimmermann
FM
2009
Springer
95views Formal Methods» more  FM 2009»
15 years 11 months ago
On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery
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 ...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
178
Voted
GECCO
2009
Springer
159views Optimization» more  GECCO 2009»
15 years 11 months ago
Bayesian network structure learning using cooperative coevolution
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...
Olivier Barrière, Evelyne Lutton, Pierre-He...
ICCAD
2000
IEEE
109views Hardware» more  ICCAD 2000»
15 years 11 months ago
General Models for Optimum Arbitrary-Dimension FPGA Switch Box Designs
–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...
Hongbing Fan, Jiping Liu, Yu-Liang Wu
ISSS
2000
IEEE
127views Hardware» more  ISSS 2000»
15 years 11 months ago
Lower Bound Estimation for Low Power High-Level Synthesis
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
Lars Kruse, Eike Schmidt, Gerd Jochens, Ansgar Sta...