Sciweavers

16404 search results - page 877 / 3281
» A set coverage problem
Sort
View
SARA
2009
Springer
16 years 2 months ago
Some Interval Approximation Techniques for MINLP
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
Nicolas Berger, Laurent Granvilliers
CEC
2008
IEEE
16 years 2 months ago
A multi-agent based evolutionary algorithm in non-stationary environments
— In this paper, a multi-agent based evolutionary algorithm (MAEA) is introduced to solve dynamic optimization problems. The agents simulate living organism features and co-evolv...
Yang Yan, Hongfeng Wang, Dingwei Wang, Shengxiang ...
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
16 years 1 months ago
Auditing a Batch of SQL Queries
In this paper, we study the problem of auditing a batch of SQL queries: given a set of SQL queries that have been posed over a database, determine whether some subset of these quer...
Rajeev Motwani, Shubha U. Nabar, Dilys Thomas
ICMCS
2007
IEEE
153views Multimedia» more  ICMCS 2007»
16 years 1 months ago
Towards Adversary Aware Surveillance Systems
We consider surveillance problems to be a set of system- adversary interaction problems in which an adversary can be modeled as a rational (selfish) agent trying to maximize his ...
Vivek K. Singh, Mohan S. Kankanhalli
ACCV
2007
Springer
16 years 1 months ago
Visual Odometry for Non-overlapping Views Using Second-Order Cone Programming
Abstract. We present a solution for motion estimation for a set of cameras which are firmly mounted on a head unit and do not have overlapping views in each image. This problem re...
Jae-Hak Kim, Richard I. Hartley, Jan-Michael Frahm...