Sciweavers

4067 search results - page 717 / 814
» Programs for Applying Symmetries
Sort
View
PLDI
2006
ACM
14 years 3 months ago
Context-sensitive domain-independent algorithm composition and selection
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...
Troy A. Johnson, Rudolf Eigenmann
INFOCOM
2005
IEEE
14 years 2 months ago
Bounding the power rate function of wireless ad hoc networks
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
Yunnan Wu, Qian Zhang, Wenwu Zhu, Sun-Yuan Kung
ACMICEC
2005
ACM
156views ECommerce» more  ACMICEC 2005»
14 years 2 months ago
Establishing and maintaining compatibility in service oriented business collaboration
Current composite web service development and management solutions, e.g. BPEL, do not cater for assessing and maintaining comparability of business partners during business collab...
Bart Orriëns, Jian Yang
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
14 years 2 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
CP
2005
Springer
14 years 2 months ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville