Sciweavers

3082 search results - page 103 / 617
» New Bounds for the Controller Problem
Sort
View
JGAA
2007
142views more  JGAA 2007»
15 years 4 months ago
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
Kerri Morgan, Graham Farr
ENTCS
2008
83views more  ENTCS 2008»
15 years 4 months ago
Controlling Control Flow in Web Applications
Control flow is often key problem in current web applications. For example, using the back button gives a POSTDATA error, using multiple windows books the wrong hotel, and sending...
Robin Message, Alan Mycroft
AGENTS
2000
Springer
15 years 8 months ago
Design-to-Criteria Scheduling: Real-Time Agent Control
Design-to-Criteria builds custom schedules for agents that meet hard temporal constraints, hard resource constraints, and soft constraints stemming from soft task interactions or ...
Thomas Wagner, Victor R. Lesser
NCA
2006
IEEE
15 years 4 months ago
Open-loop regulation and tracking control based on a genealogical decision tree
The goal of this paper is to design a new control algorithm for open-loop control of complex systems. This control approach is based on a genealogical decision tree for both regula...
Kaddour Najim, Enso Ikonen, P. Del Moral
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
15 years 10 months ago
Optimal antenna placement using a new multi-objective chc algorithm
Radio network design (RND) is a fundamental problem in cellular networks for telecommunications. In these networks, the terrain must be covered by a set of base stations (or anten...
Antonio J. Nebro, Enrique Alba, Guillermo Molina, ...