Sciweavers

749 search results - page 32 / 150
» Combinatory Models and Symbolic Computation
Sort
View
ISCAS
2006
IEEE
65views Hardware» more  ISCAS 2006»
14 years 3 months ago
Symbolic analysis of bifurcations in planar variable structure systems
— In this paper a methodology to the analysis of bifurcations of variable structure systems is proposed. This methodology, based on the use of symbolic computation packages, is d...
Ubirajara F. Moreno, Eugênio B. Castelan, Ed...
CONCUR
2005
Springer
14 years 3 months ago
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models...
Ahmed Bouajjani, Markus Müller-Olm, Tayssir T...
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
14 years 3 months ago
Harmony search for structural design
Various algorithms have been developed and applied to structural optimization, in which cross-sectional areas of structure members are assumed to be continuous. In most cases of p...
Zong Woo Geem, Kang Seok Lee, Chung-Li Tseng
JALC
2008
72views more  JALC 2008»
13 years 9 months ago
Maximal Error-Detecting Capabilities of Formal Languages
A combinatorial channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability&q...
Stavros Konstantinidis, Pedro V. Silva
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
13 years 9 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...