Sciweavers

3825 search results - page 363 / 765
» More on pooling spaces
Sort
View
ACTA
2007
114views more  ACTA 2007»
15 years 6 months ago
Hybridization methods for the analysis of nonlinear systems
Abstract In this article, we describe some recent results on the hybridization methods for the analysis of nonlinear systems. The main idea of our hybridization approach is to appl...
Eugene Asarin, Thao Dang, Antoine Girard
ANOR
2010
116views more  ANOR 2010»
15 years 6 months ago
A model and case study for efficient shelf usage and assortment analysis
In the rapidly changing environment of Fast Moving Consumer Goods sector where new product launches are frequent, retail channels need to reallocate their shelf spaces intelligent...
Mehmet Murat Fadiloglu, Oya Ekin Karasan, Mustafa ...
CORR
2008
Springer
57views Education» more  CORR 2008»
15 years 6 months ago
Square Complex Orthogonal Designs with Low PAPR and Signaling Complexity
Abstract--Space-Time Block Codes from square complex orthogonal designs (SCOD) have been extensively studied and most of the existing SCODs contain large number of zero. The zeros ...
Smarajit Das, B. Sundar Rajan
DSS
2008
83views more  DSS 2008»
15 years 6 months ago
Knowledge discovery for adaptive negotiation agents in e-marketplaces
Intelligent software agents are promising in improving the effectiveness of e-marketplaces for e-commerce. Although a large amount of research has been conducted to develop negoti...
Raymond Y. K. Lau, Yuefeng Li, Dawei Song, Ron Chi...
CPC
2006
110views more  CPC 2006»
15 years 6 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin