Sciweavers

254 search results - page 29 / 51
» On the randomized solution of initial value problems
Sort
View
JGS
2006
154views more  JGS 2006»
13 years 8 months ago
Area-to-point Kriging with inequality-type data
In practical applications of area-to-point spatial interpolation, inequality constraints, such as non-negativity, or more general constraints on the maximum and/or minimum allowab...
E.-H. Yoo, Phaedon C. Kyriakidis
WSC
2000
13 years 10 months ago
Mathematical programming models of discrete event system dynamics
Analytical models for the dynamics of some discrete event systems are introduced where the system trajectories are solutions to linear and mixed-integer programs. 1 BACKGROUND The...
Lee Schruben
DAC
2000
ACM
14 years 9 months ago
Fingerprinting intellectual property using constraint-addition
Recently, intellectual property protection (IPP) techniques attracted a great deal of attention from semiconductor, system integration and software companies. A number of watermar...
Gang Qu, Miodrag Potkonjak
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
13 years 8 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...
TEC
2010
120views more  TEC 2010»
13 years 3 months ago
Benefits of a Population: Five Mechanisms That Advantage Population-Based Algorithms
This paper identifies five distinct mechanisms by which a population-based algorithm might have an advantage over a solo-search algorithm in classical optimization. These mechanism...
Adam Prügel-Bennett