Sciweavers

2457 search results - page 145 / 492
» Local Search with Bootstrapping
Sort
View
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
15 years 3 months ago
Relativized NP Search Problems and Propositional Proof Systems
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
Josh Buresh-Oppenheim, Tsuyoshi Morioka
CP
2000
Springer
15 years 2 months ago
New Search Heuristics for Max-CSP
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
Kalev Kask
COR
2011
14 years 5 months ago
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...
Kerem Bülbül
WWW
2005
ACM
15 years 10 months ago
Making RDF presentable: integrated global and local semantic Web browsing
This paper discusses generating document structure from annotated media repositories in a domain-independent manner. This approaches the vision of a universal RDF browser. We star...
Lloyd Rutledge, Jacco van Ossenbruggen, Lynda Hard...
AIRWEB
2008
Springer
15 years 14 hour ago
Robust PageRank and locally computable spam detection features
Since the link structure of the web is an important element in ranking systems on search engines, web spammers widely use the link structure of the web to increase the rank of the...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...