Result 1 to 20 of 285 total
Static load balancing for multi-level Monte Carlo finite volume solvers. (English)
Wyrzykowski, Roman (ed.) et al., Parallel processing and applied mathematics. 9th international conference, PPAM 2011, Torun, Poland, September 11‒14, 2011. Revised selected papers, Part I. Berlin: Springer (ISBN 978-3-642-31463-6/pbk). Lecture Notes in Computer Science 7203, 245-254 (2012).
1
Complexity of majority monopoly and signed domination problems. (English)
J. Discrete Algorithms 10, 49-60 (2012).
2
Special issue: Selected papers based on the presentations at the international conference on optimization and its applications (ICOIA-BHU-2010), Varanasi, India, February 16‒18, 2010. (English)
Optim. Lett. 6, No. 2, 219-392 (2012).
3
The complexity of König subgraph problems and above-guarantee vertex cover. (English)
Algorithmica 61, No. 4, 857-881 (2011).
4
Orbit of an image under iterated system. (English)
Commun. Nonlinear Sci. Numer. Simul. 16, No. 3, 1469-1482 (2011).
5
IT enabled mass customisation as a tool for bond building - an indian case study. (English)
Int. J. Bus. Inf. Syst. 7, No. 2, 136-148 (2011).
6
Strategic issues for A successful E-commerce. (English)
Comput. Res. Repos. 2011, Article No. 1102.0706 (2011).
7
Safevchat: detecting obscene content and misbehaving users in online video chat services. (English)
Comput. Res. Repos. 2011, Article No. 1101.3124 (2011).
8
Discovery and high availability of services in auto-load balanced clusters. (English)
Meghanathan, Natarajan (ed.) et al., Advances in computer science and information technology. First international conference on computer science and information technology, CCSIT 2011, Bangalore, India, January 2‒4, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-17856-6/pbk; 978-3-642-17857-3/pbk). Communications in Computer and Information Science 131, 491-500 (2011).
9
Approximation algorithms for minimum chain vertex deletion. (English)
Katoh, Naoki (ed.) et al., WALCOM: Algorithms and computation. 5th international workshop, WALCOM 2011, New Delhi, India, February 18‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19093-3/pbk). Lecture Notes in Computer Science 6552, 21-32 (2011).
10
On the maximum uniquely restricted matching for bipartite graphs (English)
Electronic Notes in Discrete Mathematics 37, 345-350 (2011).
11
Improving reliability of jamming attack detection in ad hoc networks (English)
IJCNIS 3, No. 1 (2011).
12
Constraint preserving schemes using potential-based fluxes. II. genuinely multidimensional systems of conservation laws (English)
SIAM J. Numerical Analysis 49, No. 3, 1023-1045 (2011).
13
Well-balanced and energy stable schemes for the shallow water equations with discontinuous topography (English)
J. Comput. Physics 230, No. 14, 5587-5609 (2011).
14
A hybrid ant colony optimization technique for power signal pattern classification (English)
Expert Syst. Appl. 38, No. 5, 6368-6375 (2011).
15
Hybrid reliable load balancing with MOSIX as middleware and its formal verification using process algebra (English)
Future Generation Comp. Syst. 27, No. 5, 506-526 (2011).
16
Understanding characteristics of available bandwidth in wireless environment (English)
Procedia CS 5, 248-254 (2011).
17
Implicit-explicit schemes for flow equations with stiff source terms (English)
J. Computational Applied Mathematics 235, No. 6, 1564-1577 (2011).
18
A (Q, R) model for fuzzified deterioration under cobweb phenomenon and permissible delay in payment (English)
Computers & Mathematics with Applications 61, No. 4, 921-932 (2011).
19
Resource allocation for multi access MIMO systems (English)
IJMCMC 3, No. 3, 36-50 (2011).
20
Result 1 to 20 of 285 total
Start
Contact
Print
General Help
