Sciweavers

8780 search results - page 228 / 1756
» On the Feasibility of Consistent Computations
Sort
View
POPL
2006
ACM
16 years 7 months ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer
GECCO
2004
Springer
122views Optimization» more  GECCO 2004»
16 years 19 days ago
An Improved Diversity Mechanism for Solving Constrained Optimization Problems Using a Multimembered Evolution Strategy
This paper presents an improved version of a simple evolution strategy (SES) to solve global nonlinear optimization problems. As its previous version, the approach does not require...
Efrén Mezura-Montes, Carlos A. Coello Coell...
CODES
2010
IEEE
15 years 5 months ago
Improving platform-based system synthesis by satisfiability modulo theories solving
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...
Felix Reimann, Michael Glaß, Christian Haube...
DASFAA
2011
IEEE
311views Database» more  DASFAA 2011»
14 years 11 months ago
3D Indoor Route Planning for Arbitrary-Shape Objects
Route planning, which is used to calculate feasible routes in a given environment, is one of the key issues in navigation systems. According to different constraints in different...
Wenjie Yuan, Markus Schneider
DAC
2007
ACM
16 years 8 months ago
Parameterized Macromodeling for Analog System-Level Design Exploration
In this paper we propose a novel parameterized macromodeling technique for analog circuits. Unlike traditional macromodels that are only extracted for a small variation space, our...
Jian Wang, Xin Li, Lawrence T. Pileggi