Sciweavers

114 search results - page 12 / 23
» Reasoning over Networks by Symbolic Methods
Sort
View
ICNP
1998
IEEE
13 years 11 months ago
Distributed Network Flow Control based on Dynamic Competitive Markets
Network applications require a certain level of network performance for their proper operation. These individual guarantees can be provided if su cient amounts of network resource...
Errin W. Fulp, Douglas S. Reeves
AINA
2009
IEEE
14 years 1 months ago
Improving Opportunistic Data Dissemination via Known Vector
An opportunistic network is a network where each node only has connectiviy with other nodes opportunistically. To disseminate data in this kind of network is a challenging task an...
Jyh-How Huang, Ying-Yu Chen, Yi-Chao Chen, Shivaka...
CP
2007
Springer
13 years 10 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
EOR
2006
73views more  EOR 2006»
13 years 6 months ago
Path relinking and GRG for artificial neural networks
Artificial neural networks (ANN) have been widely used for both classification and prediction. This paper is focused on the prediction problem in which an unknown function is appr...
Abdellah El-Fallahi, Rafael Martí, Leon S. ...
EUC
2006
Springer
13 years 10 months ago
Cross-Layer Duty Cycle Scheduling with Data Aggregation Routing in Wireless Sensor Networks
Abstract. Well-scheduled communications, in conjunction with the aggregation of data reduce the energy waste on idle listening and redundant transmissions. In addition, the adjusta...
Yean-Fu Wen, Frank Yeong-Sung Lin