Sciweavers

2168 search results - page 388 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
123
Voted
AICOM
2002
103views more  AICOM 2002»
15 years 2 months ago
The emergent computational potential of evolving artificial living systems
The computational potential of artificial living systems can be studied without knowing the algorithms that govern their behavior. Modeling single organisms by means of socalled c...
Jirí Wiedermann, Jan van Leeuwen
126
Voted
CCE
2004
15 years 2 months ago
Optimization under uncertainty: state-of-the-art and opportunities
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncer...
Nikolaos V. Sahinidis
132
Voted
DPD
2002
125views more  DPD 2002»
15 years 2 months ago
Parallel Mining of Outliers in Large Database
Data mining is a new, important and fast growing database application. Outlier (exception) detection is one kind of data mining, which can be applied in a variety of areas like mon...
Edward Hung, David Wai-Lok Cheung
PR
2007
189views more  PR 2007»
15 years 2 months ago
Information cut for clustering using a gradient descent approach
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
CASES
2010
ACM
15 years 19 days ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau