Sciweavers

522 search results - page 40 / 105
» A Graph Theoretical Approach to Network Encoding Complexity
Sort
View
ATAL
2010
Springer
15 years 4 months ago
Using graph analysis to study networks of adaptive agent
Experimental analysis of networks of cooperative learning agents (to verify certain properties such as the system's stability) has been commonly used due to the complexity of...
Sherief Abdallah
KCAP
2003
ACM
15 years 8 months ago
Using transformations to improve semantic matching
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
Peter Z. Yeh, Bruce W. Porter, Ken Barker
IJBRA
2008
66views more  IJBRA 2008»
15 years 3 months ago
Integer programming-based approach to allocation of reporter genes for cell array analysis
Abstract Observing behaviors of protein pathways and genetic networks under various environments in living cells is essential for unraveling disease and developing drugs. For that ...
Morihiro Hayashida, Fuyan Sun, Sachiyo Aburatani, ...
QSHINE
2005
IEEE
15 years 8 months ago
Adaptive Low-Complexity Erasure-Correcting Code-Based Protocols for QoS-Driven Mobile Multicast Services
—We propose an adaptive hybrid automatic repeat request–forward error correction (ARQ–FEC) erasure-correcting scheme for quality of service (QoS)-driven mobile multicast serv...
Qinghe Du, Xi Zhang
ANOR
2011
96views more  ANOR 2011»
14 years 10 months ago
Global propagation of side constraints for solving over-constrained problems
This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These ...
Thierry Petit, Emmanuel Poder