Sciweavers

1939 search results - page 143 / 388
» Dynamic Lex Constraints
Sort
View
INFOCOM
2002
IEEE
15 years 9 months ago
Maxmin fair scheduling in wireless networks
—We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints....
Leandros Tassiulas, Saswati Sarkar
FMOODS
2006
15 years 5 months ago
Security Issues in Service Composition
Abstract. We use a distributed, enriched -calculus for describing networks of services. Both services and their clients can protect themselves, by imposing security constraints on ...
Massimo Bartoletti, Pierpaolo Degano, Gian Luigi F...
JDA
2010
122views more  JDA 2010»
14 years 11 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Ignasi Sau, Dimitrios M. Thilikos
ECOOP
2000
Springer
15 years 8 months ago
Optimizing Java Programs in the Presence of Exceptions
The support for precise exceptions in Java, combined with frequent checks for runtime exceptions, leads to severe limitations on the compiler’s ability to perform program optimiz...
Manish Gupta, Jong-Deok Choi, Michael Hind
RECONFIG
2009
IEEE
165views VLSI» more  RECONFIG 2009»
15 years 10 months ago
Composable and Persistent-State Application Swapping on FPGAs Using Hardwired Network on Chip
—We envision that future FPGA will use a hardwired network on chip (HWNoC) [14] as a unified interconnect for functional communications (data and control) as well as configurat...
Muhammad Aqeel Wahlah, Kees G. W. Goossens