Sciweavers

1547 search results - page 26 / 310
» Solving Knapsack Problems in a Sticker Based Model
Sort
View
IBIS
2006
109views more  IBIS 2006»
13 years 7 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
ICOODB
2010
129views Database» more  ICOODB 2010»
13 years 6 months ago
Solving ORM by MAGIC: MApping GeneratIon and Composition
Object-relational mapping (ORM) technologies have been proposed as a solution for the impedance mismatch problem between object-oriented applications and relational databases. Exis...
David Kensche, Christoph Quix, Xiang Li 0002, Sand...
GPEM
2006
161views more  GPEM 2006»
13 years 7 months ago
Solving differential equations with genetic programming
A novel method for solving ordinary and partial differential equations, based on grammatical evolution is presented. The method forms generations of trial solutions expressed in an...
Ioannis G. Tsoulos, Isaac E. Lagaris
IJCAI
2007
13 years 9 months ago
On Modeling Multiagent Task Scheduling as a Distributed Constraint Optimization Problem
This paper investigates how to represent and solve multiagent task scheduling as a Distributed Constraint Optimization Problem (DCOP). Recently multiagent researchers have adopted...
Evan Sultanik, Pragnesh Jay Modi, William C. Regli
ICASSP
2011
IEEE
12 years 11 months ago
Worst-case based robust adaptive beamforming for general-rank signal models using positive semi-definite covariance constraint
In this paper, we develop a new approach to the robust beamforming for general-rank signal models. Our method is based on the worst-case performance optimization using a semi-de n...
Haihua Chen, Alex B. Gershman