Sciweavers

2845 search results - page 301 / 569
» Constraints over Ontologies
Sort
View
97
Voted
CONSTRAINTS
2006
77views more  CONSTRAINTS 2006»
15 years 24 days ago
The Impact of Search Heuristics on Heavy-Tailed Behaviour
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
Tudor Hulubei, Barry O'Sullivan
TAP
2008
Springer
93views Hardware» more  TAP 2008»
15 years 20 days ago
Pex-White Box Test Generation for .NET
Pex automatically produces a small test suite with high code coverage for a .NET program. To this end, Pex performs a systematic program analysis (using dynamic symbolic execution,...
Nikolai Tillmann, Jonathan de Halleux
ESWA
2007
100views more  ESWA 2007»
15 years 16 days ago
Using memetic algorithms with guided local search to solve assembly sequence planning
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
Hwai-En Tseng, Wen-Pai Wang, Hsun-Yi Shih
SCP
1998
163views more  SCP 1998»
15 years 12 days ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
95
Voted
SIAMCO
2002
71views more  SIAMCO 2002»
15 years 12 days ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner