Filters
NP search problems in low fragments of bounded arithmetic
NP search problems in low fragments of bounded arithmetic...
BA - Obecná matematika
- 2007 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
A Metaheuristic to Solve a Location Routing Problem with Non-Linear
The paper deals with location-routing problem with nonlivear carts. The problem is NP-Nord, Soheuristic elgorithms are needed to solve the problem. A metaheuristic merging Tabu Search and Variable Neighborhood ...
BB - Aplikovaná statistika, operační výzkum
- 2005 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Travelin Salesman Problem by Penalized Local Search
Traveling salesman problem is one of the most known problems solved by combinatorial optimization. This paper deals with the way of solving traveling salesman problem by penalized local search algorithm. It is show...
IN - Informatika
- 2008 •
- D
Rok uplatnění
D - Stať ve sborníku
A variable neighborhood search for the selective multi-compartment vehicle routing problem with time windows
Main topics of the document: vehicle routing problem; metaheuristic; time windous; variable neighborhood search; selective multi-compartment problem......
BB - Aplikovaná statistika, operační výzkum
- 2013 •
- D
Rok uplatnění
D - Stať ve sborníku
A Variable Neighborhood Search for the Capacitated Arc Routing Problem with Time Windows
Main topics of the document: arc routing; local search; metaheuristic; arc routing problem; optimization...
BB - Aplikovaná statistika, operační výzkum
- 2014 •
- D
Rok uplatnění
D - Stať ve sborníku
Metaheuristics Based on Occam's Razor Principle in Search Algorithms
A large number of problems can be formulated as search tasks or as sequences of search tasks. The solution of such a problem is provided by an algorithm which. quickly) an arbitrary search problem...
JC - Počítačový hardware a software
- 2007 •
- D
Rok uplatnění
D - Stať ve sborníku
Consistency of circuit evaluation, extended resolution and total NP search problems
We define a new NP search problem related to circuit evaluation and establish its link to Extended resolution proof system.
BA - Obecná matematika
- 2016 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. Specifically, it has been found that if the ...
JD - Využití počítačů, robotika a její aplikace
- 2004 •
- D
Rok uplatnění
D - Stať ve sborníku
Searching the web
A problem of the web searching is how to gain only relevant information and how to ensure its completeness. We discusse architectures of search engines, whose mechanisms provide necessary metainformation to make both pr...
JC - Počítačový hardware a software
- 2004 •
- D
Rok uplatnění
D - Stať ve sborníku
Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
The paper addresses the problem of multi-robot search for a stationary object in a priori known environment. Two variants of the problem are studied given the working Deliveryman Problem for multiple vehicles, whil...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2022 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
- 1 - 10 out of 113 573