| Publication | Date of Publication | Type |
|---|
| A new competitive algorithm for agent searching in unknown streets | 2024-07-05 | Paper |
Searching game trees under a partial order
Artificial Intelligence | 2022-09-22 | Paper |
Anytime pack search
Natural Computing | 2019-07-10 | Paper |
A near optimal algorithm for the extended cow-path problem in the presence of relative errors
Lecture Notes in Computer Science | 2017-01-19 | Paper |
Formal assessment of reliability specifications in embedded cyber-physical systems
Journal of Applied Logic | 2016-10-31 | Paper |
Incremental beam search
Information Processing Letters | 2014-04-14 | Paper |
Algorithms for generating ordered solutions for explicit AND/OR structures
The Journal of Artificial Intelligence Research (JAIR) | 2012-08-27 | Paper |
Heuristic search under contract
Computational Intelligence | 2012-03-30 | Paper |
Partition oriented frame based fair scheduler
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
A corrigendum to: ``Sticky-ERfair: a task-processor affinity aware proportional fair scheduler
Real-Time Systems | 2012-01-26 | Paper |
Sticky-ERfair: a task-processor affinity aware proportional fair scheduler
Real-Time Systems | 2012-01-26 | Paper |
| Contract Search: heuristic search under node expansion constraints | 2011-05-11 | Paper |
Can semi-formal be made more formal?
Next Generation Design and Verification Methodologies for Distributed Embedded Control Systems | 2010-06-02 | Paper |
The power of first-order quantification over states in branching and linear time temporal logics
Information Processing Letters | 2009-07-21 | Paper |
Distributed Computing - IWDC 2004
Lecture Notes in Computer Science | 2005-08-12 | Paper |
A branching time temporal framework for quantitative reasoning
Journal of Automated Reasoning | 2003-06-09 | Paper |
Min-max event-triggered computation tree logic
Sādhanā | 2003-05-01 | Paper |
A correction to: ``Agent searching in a tree and the optimality of iterative deepening
Artificial Intelligence | 2003-02-04 | Paper |
Complexity of fragmentable object bin packing and an application
Computers & Mathematics with Applications | 2002-08-06 | Paper |
Some new results in the complexity of allocation and binding in data path synthesis
Computers & Mathematics with Applications | 2002-08-06 | Paper |
Learning for efficient search
Sādhanā | 2002-02-18 | Paper |
Heuristic search strategies for multiobjective state space search
Sādhanā | 2002-02-18 | Paper |
Min-max Computation Tree Logic
Artificial Intelligence | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1386739 (Why is no real title available?) | 2000-01-11 | Paper |
A probabilistic estimator for the vertex deletion problem
Computers & Mathematics with Applications | 1998-08-20 | Paper |
Utility of pathmax in partial order heuristic search
Information Processing Letters | 1997-02-27 | Paper |
Agent search in uniform b-ary trees: Multiple goals and unequal costs
Information Processing Letters | 1997-02-27 | Paper |
Multiobjective Heuristic Search in AND/OR Graphs
Journal of Algorithms | 1996-12-11 | Paper |
Agent searching in a tree and the optimality of iterative deepening
Artificial Intelligence | 1995-01-09 | Paper |
Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
Artificial Intelligence | 1994-05-03 | Paper |
Improving Greedy Algorithms by Lookahead-Search
Journal of Algorithms | 1994-04-28 | Paper |
Effective use of memory in iterative deepening search
Information Processing Letters | 1993-01-16 | Paper |
A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem
Information Processing Letters | 1993-01-16 | Paper |
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
Artificial Intelligence | 1992-06-28 | Paper |
A general best first search algorithm in AND/OR graphs
Journal of Algorithms | 1992-06-28 | Paper |
Generalized best first search using single and multiple heuristics
Information Sciences | 1992-06-28 | Paper |
The t-cost-m-neighbour distance in digital geometry
Journal of Geometry | 1991-01-01 | Paper |
Multiple stack branch and bound
Information Processing Letters | 1991-01-01 | Paper |
Admissibility of \(AO^ *\) when heuristics overestimate
Artificial Intelligence | 1988-01-01 | Paper |
Distance functions in digital geometry
Information Sciences | 1987-01-01 | Paper |
Generalized distances in digital geometry
Information Sciences | 1987-01-01 | Paper |
Heuristic search through islands
Artificial Intelligence | 1986-01-01 | Paper |
