Result 1 to 17 of 17 total
Identifying influential stock indices from global stock markets: A social network analysis approach (English)
Procedia CS 5, 442-449 (2011).
1
Social disparities in internet patient portal use in diabetes: evidence that the digital divide extends beyond access (English)
JAMIA 18, No. 3, 318-321 (2011).
2
A social network approach to examine the role of influential stocks in shaping interdependence structure in global stock markets (English)
ASONAM, 567-569 (2011).
3
Balancing load of aps by concurrent association of every wireless node with many aps (English)
ICNS, 320-325 (2009).
4
Development of a micrometeorological model for the estimation of methane flux from paddy fields: validation with standard direct measurements (English)
Environmental Modelling and Software 23, No. 10-11, 1229-1239 (2008).
5
Bandwidth estimation for multiplexed videos using multinomial model. (English)
Comput. Commun. 30, No. 2, 269-279 (2007).
6
Study of long-duration MPEG-trace segmentation methods for developing frame-size-based traffic models. (English)
Comput. Netw. 44, No. 2, 177-188 (2004).
7
Modeling full-length video using Markov-modulated gamma-based framework. (English)
IEEE/ACM Trans. Netw. 11, No. 4, 638-649 (2003).
8
Landfill odour: assessment of emissions by the flux footprint method (English)
Environmental Modelling and Software 18, No. 2, 155-163 (2003).
9
On uniqueness of solution to the multi-peg Towers of Hanoi. (English)
Int. J. Comput. Math. 78, No.1, 57-72 (2001).
10
On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem. (English)
Theor. Comput. Sci. 237, No.1-2, 407-421 (2000).
11
Improving greedy algorithms by lookahead-search. (English)
J. Algorithms 16, No.1, 1-23 (1994).
12
A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem. (English)
Inf. Process. Lett. 42, No.3, 173-177 (1992).
13
Effective use of memory in iterative deepening search. (English)
Inf. Process. Lett. 42, No.1, 47-52 (1992).
14
Multiple stack branch and bound. (English)
Inf. Process. Lett. 37, No.1, 43-48 (1991).
15
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds. (English)
Artif. Intell. 50, No.2, 207-221 (1991).
16
Pruning by upperbounds in heuristic search: use of approximate algorithms (English)
KBCS, 451-461 (1989).
17
Result 1 to 17 of 17 total