Sciweavers

3452 search results - page 460 / 691
» On the Study of Negotiation Strategies
Sort
View
ANOR
2011
117views more  ANOR 2011»
14 years 10 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
226
Voted
ICASSP
2011
IEEE
14 years 10 months ago
Identification of MISO nonlinear systems via the semiparametric approach
In this paper we examine a class of multiple-input, singleoutput (MISO) nonlinear systems of the block-oriented structure. In particular, we focus on MISO Hammerstein systems bein...
Jiaqing Lv, Miroslaw Pawlak
306
Voted
CORR
2012
Springer
286views Education» more  CORR 2012»
14 years 2 months ago
A Faster Algorithm for Solving One-Clock Priced Timed Games
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that One-clock priced ti...
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter ...
JMLR
2012
13 years 9 months ago
Active Clustering of Biological Sequences
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
16 years 1 months ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer