Sciweavers

5114 search results - page 784 / 1023
» Complex networks
Sort
View
104
Voted
CSCW
1998
ACM
15 years 6 months ago
Just Talk to Me: A Field Study of Expertise Location
Everyday, people in organizations must solve their problems to get their work accomplished. To do so, they often must find others with knowledge and information. Systems that assi...
David W. McDonald, Mark S. Ackerman
KDD
1998
ACM
442views Data Mining» more  KDD 1998»
15 years 6 months ago
BAYDA: Software for Bayesian Classification and Feature Selection
BAYDA is a software package for flexible data analysis in predictive data mining tasks. The mathematical model underlying the program is based on a simple Bayesian network, the Na...
Petri Kontkanen, Petri Myllymäki, Tomi Siland...
112
Voted
ICECCS
1997
IEEE
97views Hardware» more  ICECCS 1997»
15 years 6 months ago
A Synthesis Method for Fault-tolerant and Flexible Multipath Routing Protocols
Design of practical routing protocols is complex and dificult due to complicated requirements of faulttolerance and flexibility. The protocol is defined to be fault-tolerant if me...
Yutaka Hatanaka, Masahide Nakamura, Yoshiaki Kakud...
110
Voted
INFOCOM
1997
IEEE
15 years 6 months ago
A Distributed Algorithm for Delay-Constrained Unicast Routing
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
Hussein F. Salama, Douglas S. Reeves, Yannis Vinio...
125
Voted
CP
2007
Springer
15 years 6 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