Result 1 to 20 of 524 total
Optimal reserve inventory between two machines when the repair time has change of distribution after a change point. (English)
Int. Math. Forum 7, No. 53-56, 2659-2668 (2012).
1
Optimal hitting sets for combinatorial shapes. (English)
Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 423-434 (2012).
2
Analysis of transient behaviour of M/G/1 queue with single vacation. (English)
Int. J. Pure Appl. Math. 76, No. 1, 149-156 (2012).
3
A survey of sensory data boundary estimation, covering and tracking techniques using collaborating sensors. (English)
Pervasive Mobile Comput. 8, No. 3, 358-375 (2012).
4
Codes on planar Tanner graphs. (English)
Adv. Math. Commun. 6, No. 2, 131-163 (2012).
5
Generalization of newsboy problem with demand distribution satisfying the SCBZ property. (English)
Int. J. Contemp. Math. Sci. 6, No. 37-40, 1989-2000 (2011).
6
Cyclic orthogonal double covers of 4-regular circulant graphs. (English)
Discrete Math. 311, No. 21, 2417-2422 (2011).
7
From invisible grids to smart cloud computing. (English)
Guarracino, Mario R. (ed.) et al., Euro-Par 2010 parallel processing workshops. HeteroPar, HPCC, HiBB, CoreGrid, UCHPC, HPCF, PROPER, CCPI, VHPC. Ischia, Italy, August 31 ‒ September 3, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-21877-4/pbk). Lecture Notes in Computer Science 6586, 263-270 (2011).
8
Correlation bounds for poly-size $\text{AC}^0$ circuits with $n^{1 - o(1)}$ symmetric gates. (English)
Goldberg, Leslie Ann (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17‒19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22934-3/pbk). Lecture Notes in Computer Science 6845, 640-651 (2011).
9
Streaming algorithms for recognizing nearly well-parenthesized expressions. (English)
Murlak, Filip (ed.) et al., Mathematical foundations of computer science 2011. 36th international symposium, MFCS 2011, Warsaw, Poland, August 22‒26, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22992-3/pbk). Lecture Notes in Computer Science 6907, 412-423 (2011).
10
Fast sparse matrix-vector multiplication on gpus: implications for graph mining. (English)
Comput. Res. Repos. 2011, Article No. 1103.2405 (2011).
11
Almost settling the hardness of noncommutative determinant. (English)
Comput. Res. Repos. 2011, Article No. 1101.1169 (2011).
12
Efficient interaction between OS and architecture in heterogeneous platforms. (English)
Oper. Syst. Rev. 45, No. 1, 62-72 (2011).
13
Intrusion detection algorithm for MANET (English)
IJISP 5, No. 3, 36-49 (2011).
14
On the security of randomized arithmetic codes against ciphertext-only attacks (English)
IEEE Transactions on Information Forensics and Security 6, No. 1, 19-27 (2011).
15
The tyranny of the vital few: the Pareto principle in language design (English)
JSEA 4, No. 3, 146-155 (2011).
16
Cogniserve: heterogeneous server architecture for large-scale recognition (English)
IEEE Micro 31, No. 3, 20-31 (2011).
17
Navigating the cloud computing landscape - technologies, services, and adopters (English)
IEEE Computer 44, No. 3, 22-23 (2011).
18
Fast sparse matrix-vector multiplication on gpus: implications for graph mining (English)
PVLDB 4, No. 4, 231-242 (2011).
19
Maximizing hotspot temperature: wavelet based modelling of heating and cooling profile of functional workloads (English)
ISQED, 559-565 (2011).
20
Result 1 to 20 of 524 total
Start
Contact
Print
General Help
