Sciweavers

5114 search results - page 63 / 1023
» Complex networks
Sort
View
EOR
2008
136views more  EOR 2008»
13 years 9 months ago
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...
ICECCS
2010
IEEE
162views Hardware» more  ICECCS 2010»
13 years 9 months ago
Trust-Based Adaptation in Complex Service-Oriented Systems
Abstract—Complex networks consisting of humans and software services, such as Web-based social and collaborative environments, typically require flexible and context-based inter...
Florian Skopik, Daniel Schall, Schahram Dustdar
COCOON
2008
Springer
13 years 11 months ago
Multi-party Quantum Communication Complexity with Routed Messages
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashit...
IEEECIT
2006
IEEE
14 years 3 months ago
A Complexity Metrics Set for Large-Scale Object-Oriented Software Systems
Although traditional software metrics have widely been applied to practical software projects, they have insufficient abilities to measure a large-scale system’s complexity at h...
Yutao Ma, Keqing He, Dehui Du, Jing Liu, Yulan Yan
WIOPT
2010
IEEE
13 years 7 months ago
Low complexity algorithms for relay selection and power control in interference-limited environments
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...
Lazaros Gkatzikis, Iordanis Koutsopoulos