Sciweavers

11573 search results - page 2221 / 2315
» Designing Relational Databases
Sort
View
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
15 years 9 months ago
Methodology to select solutions from the pareto-optimal set: a comparative study
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
José C. Ferreira, Carlos M. Fonseca, Ant&oa...
IPSN
2007
Springer
15 years 9 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
ISSAC
2007
Springer
128views Mathematics» more  ISSAC 2007»
15 years 9 months ago
Productivity and performance using partitioned global address space languages
Partitioned Global Address Space (PGAS) languages combine the programming convenience of shared memory with the locality and performance control of message passing. One such langu...
Katherine A. Yelick, Dan Bonachea, Wei-Yu Chen, Ph...
ISW
2007
Springer
15 years 9 months ago
Queue Management as a DoS Counter-Measure?
In this paper, we study the performance of timeout-based queue management practices in the context of flood denial-of-service (DoS) attacks on connection-oriented protocols, where...
Daniel Boteanu, José M. Fernandez, John McH...
LCTRTS
2007
Springer
15 years 9 months ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue
« Prev « First page 2221 / 2315 Last » Next »