Sciweavers

1422 search results - page 270 / 285
» Test Generation Algorithms Based on Preorder Relations
Sort
View
CCGRID
2007
IEEE
15 years 4 months ago
Performance Evaluation in Grid Computing: A Modeling and Prediction Perspective
Experimental performance studies on computer systems, including Grids, require deep understandings on their workload characteristics. The need arises from two important and closel...
Hui Li
ILP
2005
Springer
15 years 3 months ago
Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
Yi-Dong Shen, Qiang Yang
80
Voted
EOR
2008
106views more  EOR 2008»
14 years 9 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
15 years 10 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
PERCOM
2009
ACM
15 years 4 months ago
TreeMAC: Localized TDMA MAC Protocol for Real-time High-data-rate Sensor Networks
—Earlier sensor network MAC protocols focus on energy conservation in low-duty cycle applications, while some recent applications involve real-time high-data-rate signals. This m...
Wen-Zhan Song, Renjie Huang, Behrooz Shirazi, Rich...