Výsledky vyhľadávania - Computing methodologies Artificial intelligence Search methodologies Discrete space search
-
1
LEGION: Best-First Concolic Testing
ISSN: 2643-1572Vydavateľské údaje: ACM 01.09.2020Vydané v 2020 35th IEEE/ACM International Conference on Automated Software Engineering (ASE) (01.09.2020)“… Legion re-engineers the Monte Carlo tree search (MCTS) framework from the AI literature to treat automated test generation as a problem of sequential decision-making under uncertainty…”
Získať plný text
Konferenčný príspevok.. -
2
Accelerating Decision-Tree-Based Inference Through Adaptive Parallelization
Vydavateľské údaje: IEEE 21.10.2023Vydané v 2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT) (21.10.2023)“… They are applied to a broad spectrum of applications as diverse as search engine ranking, credit card fraud detection, customer relationship management, fault diagnosis in machinery, and geological…”
Získať plný text
Konferenčný príspevok.. -
3
Optimizing Tensor Computation Graphs with Equality Saturation and Monte Carlo Tree Search
Vydavateľské údaje: ACM 13.10.2024Vydané v 2024 33rd International Conference on Parallel Architectures and Compilation Techniques (PACT) (13.10.2024)“…The real-world effectiveness of deep neural networks often depends on their latency, thereby necessitating optimization techniques that can reduce a model's…”
Získať plný text
Konferenčný príspevok.. -
4
Adaptive bug isolation
ISBN: 9781605587196, 1605587192ISSN: 0270-5257Vydavateľské údaje: New York, NY, USA ACM 01.05.2010Vydané v 2010 ACM/IEEE 32nd International Conference on Software Engineering (01.05.2010)“… We formulate this approach as a search on the control-dependence graph of the program. We present and evaluate various heuristics that can be used for this search…”
Získať plný text
Konferenčný príspevok.. -
5
Neuromorphic Monte Carlo Tree Search Methods for Shortest Path Interdiction
Vydavateľské údaje: IEEE 30.07.2024Vydané v 2024 International Conference on Neuromorphic Systems (ICONS) (30.07.2024)“…Monte Carlo tree search (MCTS) is a commonly used heuristic algorithm to explore extremely large search spaces for decision making in general and for tackling Stackelberg games in particular…”
Získať plný text
Konferenčný príspevok.. -
6
A Tree Based Router Search Engine Architecture with Single Port Memories
ISBN: 076952270X, 9780769522708ISSN: 1063-6897Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 01.05.2005Vydané v 32nd International Symposium on Computer Architecture (ISCA'05) (01.05.2005)“…Pipelined forwarding engines are used in core routers to meet speed demands. Tree-based searches are pipelined across a number of stages to achieve high throughput, but this results in unevenly distributed memory…”
Získať plný text
Konferenčný príspevok.. -
7
Quantum Circuit Compilers Using Gate Commutation Rules
ISSN: 2153-697XVydavateľské údaje: ACM 21.01.2019Vydané v 2019 24th Asia and South Pacific Design Automation Conference (ASP-DAC) (21.01.2019)“…The use of noisy intermediate-scale quantum computers (NISQCs), which consist of dozens of noisy qubits with limited coupling constraints, has been increasing…”
Získať plný text
Konferenčný príspevok.. -
8
An Evolutionary Framework for Analyzing the Distance Preserving Property of Weighted Graphs
ISBN: 1450349935, 9781450349932ISSN: 2473-991XVydavateľské údaje: New York, NY, USA ACM 31.07.2017Vydané v 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) (31.07.2017)“… Here, we propose a biologically-inspired search algorithm to address the problem of finding isometric subgraphs that consequently determines if a given graph is distance preserving…”
Získať plný text
Konferenčný príspevok.. -
9
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
ISBN: 1595930612, 9781595930613Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 2005Vydané v Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)“… This paper presents a distributed breadth- first search (BFS) scheme that scales for random graphs with up to three billion vertices and 30 billion edges…”
Získať plný text
Konferenčný príspevok.. -
10
Efficient SAT solving: beyond supercubes
ISBN: 1595930582, 9781595930583Vydavateľské údaje: New York, NY, USA ACM 13.06.2005Vydané v Proceedings 2005 : Design Automation Conference : Anaheim Convention Center, Anaheim, CA, June 13-17, 2005 (13.06.2005)“… Recently, Goldberg et al introduced supercubing, a different approach to search-space pruning, based on a theory that unifies many existing methods…”
Získať plný text
Konferenčný príspevok.. -
11
Multi-feature and DAG-Based Multi-tree Matching Algorithm for Automatic Web Data Mining
Vydavateľské údaje: IEEE 01.08.2014Vydané v 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) (01.08.2014)“…Web data extraction has received considerable attention and study in recent decades. To improve efficiency, many automatic Web data record mining approaches…”
Získať plný text
Konferenčný príspevok.. -
12
Multi-Agent Patrolling with Reinforcement Learning
ISBN: 9781581138641, 1581138644Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 19.07.2004Vydané v Autonomous Agents and Multiagent Systems: Proceedings, 3rd International Joint Conference, New York City, New York, 2004. (19.07.2004)“…Patrolling tasks can be encountered in a variety of real-world domains, ranging from computer network administration and surveillance to computer wargame…”
Získať plný text
Konferenčný príspevok.. -
13
Developing a Deterministic Patrolling Strategy for Security Agents
ISBN: 0769538010, 9780769538013Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 15.09.2009Vydané v Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 (15.09.2009)“…Developing autonomous systems that patrol environments for detecting intruders is a topic of increasing relevance in security applications. An important aspect…”
Získať plný text
Konferenčný príspevok.. -
14
An Autonomy-Oriented Paradigm for Self-Organized Computing
ISBN: 0769538010, 9780769538013Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 2009Vydané v Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 (2009)“…A bottom-up computing paradigm, namely Autonomy-Oriented Computing (AOC), offers some principles and mechanisms for non-linearly solving computationally hard problems…”
Získať plný text
Konferenčný príspevok.. -
15
A Theoretical Analysis of Multi-Agent Patrolling Strategies
ISBN: 9781581138641, 1581138644Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 19.07.2004Vydané v Autonomous Agents and Multiagent Systems: Proceedings, 3rd International Joint Conference, New York City, New York, 2004. (19.07.2004)Získať plný text
Konferenčný príspevok.. -
16
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
ISBN: 0769538010, 9780769538013Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 15.09.2009Vydané v Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 (15.09.2009)“…In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and…”
Získať plný text
Konferenčný príspevok.. -
17
The M2M Pathfinding Algorithm Based on the Idea of Granular Computing
ISBN: 0769538010, 9780769538013Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 15.09.2009Vydané v Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 (15.09.2009)“…) bit memory space and can be updated in O(1) expected time to handle changes. Although the resulting path is not always the shortest one, it can make a trade-off…”
Získať plný text
Konferenčný príspevok.. -
18
Code Difference Guided Adversarial Example Generation for Deep Code Models
ISSN: 2643-1572Vydavateľské údaje: IEEE 11.09.2023Vydané v IEEE/ACM International Conference on Automated Software Engineering : [proceedings] (11.09.2023)“… Moreover, the adversarial example generation techniques specific to deep code models still suffer from unsatisfactory effectiveness due to the enormous ingredient search space…”
Získať plný text
Konferenčný príspevok.. -
19
Parallel multiple sequence alignment with local phylogeny search by simulated annealing
ISBN: 1424400546, 9781424400546Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 25.04.2006Vydané v Proceedings of the 20th international conference on Parallel and distributed processing (25.04.2006)“…The problem of multiple sequence alignment is one of the most important problems in computational biology. In this paper we present a new method that…”
Získať plný text
Konferenčný príspevok.. -
20
PertNAS: Architectural Perturbations for Memory-Efficient Neural Architecture Search
Vydavateľské údaje: IEEE 09.07.2023Vydané v 2023 60th ACM/IEEE Design Automation Conference (DAC) (09.07.2023)“… In this way, it extracts high-quality motifs from the search space. We utilize these perturbations to perform NAS in compact models evolving over time to traverse the search space…”
Získať plný text
Konferenčný príspevok..

