Sciweavers

474 search results - page 61 / 95
» Computing integral solutions of complementarity problems
Sort
View
ICALP
2011
Springer
14 years 1 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
IEEEHPCS
2010
14 years 8 months ago
Semantic model checking security requirements for web services
Model checking is a formal verification method widely accepted in the web service world because of its capability to reason about service behaviors, at their process-level. It ha...
L. Boaro, E. Glorio, Francesco Pagliarecci, Luca S...
CP
2011
Springer
13 years 9 months ago
Algorithm Selection and Scheduling
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, ...
ISPD
2010
ACM
249views Hardware» more  ISPD 2010»
15 years 4 months ago
A matching based decomposer for double patterning lithography
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
Yue Xu, Chris Chu
DCOSS
2010
Springer
15 years 2 months ago
A Novel Mobility Management Scheme for Target Tracking in Cluster-Based Sensor Networks
Abstract. Target tracking is a typical and important application of wireless sensor networks (WSNs). In the consideration of scalability and energy efficiency for target tracking ...
Zhibo Wang, Wei Lou, Zhi Wang, Junchao Ma, Honglon...