Sciweavers

2321 search results - page 292 / 465
» Optimizing WebPage Interest
Sort
View
CPAIOR
2007
Springer
15 years 10 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
15 years 9 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
ISSRE
2000
IEEE
15 years 8 months ago
Building Trust into OO Components Using a Genetic Analogy
Despite the growing interest for component-based systems, few works tackle the question of the trust we can bring into a component. This paper presents a method and a tool for bui...
Benoit Baudry, Vu Le Hanh, Jean-Marc Jéz&ea...
GLOBECOM
2007
IEEE
15 years 8 months ago
S-OSPF: A Traffic Engineering Solution for OSPF Based Best Effort Networks
Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet fo...
Aditya Kumar Mishra, Anirudha Sahoo
CDC
2009
IEEE
208views Control Systems» more  CDC 2009»
15 years 5 months ago
Sensor selection for hypothesis testing in wireless sensor networks: a Kullback-Leibler based approach
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
Dragana Bajovic, Bruno Sinopoli, João Xavie...