Sciweavers

3311 search results - page 596 / 663
» Deductive Object Programming
Sort
View
CN
2007
137views more  CN 2007»
14 years 10 months ago
Defending against hitlist worms using network address space randomization
Worms are self-replicating malicious programs that represent a major security threat for the Internet, as they can infect and damage a large number of vulnerable hosts at timescal...
Spyros Antonatos, Periklis Akritidis, Evangelos P....
IJHPCA
2006
109views more  IJHPCA 2006»
14 years 10 months ago
A Resource Leasing Policy for on-Demand Computing
Leasing computational resources for on-demand computing is now a viable option for providers of network services. Temporary spikes or lulls in demand for a service can be accommod...
Darin England, Jon B. Weissman
CORR
2007
Springer
104views Education» more  CORR 2007»
14 years 9 months ago
Separable convex optimization problems with linear ascending constraints
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
Arun Padakandla, Rajesh Sundaresan
JIPS
2006
129views more  JIPS 2006»
14 years 9 months ago
Automatic Reading System for On-off Type DNA Chip
: In this study we propose an automatic reading system for diagnostic DNA chips. We define a general specification for an automatic reading system and propose a possible implementa...
Munho Ryu, Jong Dae Kim, Jongwon Kim
EOR
2007
89views more  EOR 2007»
14 years 9 months ago
The service allocation problem at the Gioia Tauro Maritime Terminal
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
Jean-François Cordeau, Manlio Gaudioso, Gil...