Sciweavers

2006 search results - page 116 / 402
» Heuristic Security-Testing Methods
Sort
View
88
Voted
CADE
2010
Springer
15 years 1 months ago
Decreasing Diagrams and Relative Termination
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair st...
Nao Hirokawa, Aart Middeldorp
88
Voted
COR
2006
108views more  COR 2006»
15 years 22 days ago
Variable neighborhood search and local branching
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...
Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
ICCAD
2008
IEEE
150views Hardware» more  ICCAD 2008»
15 years 9 months ago
Performance estimation and slack matching for pipelined asynchronous architectures with choice
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
Gennette Gill, Vishal Gupta, Montek Singh
100
Voted
JODS
2006
135views Data Mining» more  JODS 2006»
15 years 20 days ago
Managing Uncertainty in Schema Matching with Top-K Schema Mappings
In this paper, we propose to extend current practice in schema matching with the simultaneous use of top-K schema mappings rather than a single best mapping. This is a natural ext...
Avigdor Gal
101
Voted
SIGIR
2008
ACM
15 years 19 days ago
A general optimization framework for smoothing language models on graph structures
Recent work on language models for information retrieval has shown that smoothing language models is crucial for achieving good retrieval performance. Many different effective smo...
Qiaozhu Mei, Duo Zhang, ChengXiang Zhai