Sciweavers

830 search results - page 16 / 166
» Generalizing Global Constraints Based on Network Flows
Sort
View
ATAL
2007
Springer
14 years 1 months ago
Emergence of global network property based on multi-agent voting model
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to...
Kousuke Shinoda, Yutaka Matsuo, Hideyuki Nakashima
ICCAD
1993
IEEE
134views Hardware» more  ICCAD 1993»
13 years 11 months ago
Beyond the combinatorial limit in depth minimization for LUT-based FPGA designs
In this paper, we present an integrated approach to synthesis and mapping to go beyond the combinatorial limit set up by the depth-optimal FlowMap algorithm. The new algorithm, na...
Jason Cong, Yuzheng Ding
MOR
2008
169views more  MOR 2008»
13 years 7 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
GLOBECOM
2010
IEEE
13 years 5 months ago
Sliding Mode Based Joint Congestion Control and Scheduling in Multi-Hop Ad Hoc Networks with Multi-Class Services
In this paper, we consider the joint problem of congestion control and scheduling with multi-class Quality of Service (QoS) requirements. Generally, the joint problem is formulated...
Zongrui Ding, Dapeng Wu
ICML
2009
IEEE
14 years 8 months ago
Structure learning of Bayesian networks using constraints
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
Cassio Polpo de Campos, Zhi Zeng, Qiang Ji