Search Results - Computing methodologies Artificial intelligence Search methodologies Discrete space search
-
1
LEGION: Best-First Concolic Testing
ISSN: 2643-1572Published: ACM 01.09.2020Published in 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…”
Get full text
Conference Proceeding -
2
Accelerating Decision-Tree-Based Inference Through Adaptive Parallelization
Published: IEEE 21.10.2023Published in 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…”
Get full text
Conference Proceeding -
3
Optimizing Tensor Computation Graphs with Equality Saturation and Monte Carlo Tree Search
Published: ACM 13.10.2024Published in 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…”
Get full text
Conference Proceeding -
4
Adaptive bug isolation
ISBN: 9781605587196, 1605587192ISSN: 0270-5257Published: New York, NY, USA ACM 01.05.2010Published in 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…”
Get full text
Conference Proceeding -
5
Neuromorphic Monte Carlo Tree Search Methods for Shortest Path Interdiction
Published: IEEE 30.07.2024Published in 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…”
Get full text
Conference Proceeding -
6
A Tree Based Router Search Engine Architecture with Single Port Memories
ISBN: 076952270X, 9780769522708ISSN: 1063-6897Published: Washington, DC, USA IEEE Computer Society 01.05.2005Published in 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…”
Get full text
Conference Proceeding -
7
Quantum Circuit Compilers Using Gate Commutation Rules
ISSN: 2153-697XPublished: ACM 21.01.2019Published in 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…”
Get full text
Conference Proceeding -
8
An Evolutionary Framework for Analyzing the Distance Preserving Property of Weighted Graphs
ISBN: 1450349935, 9781450349932ISSN: 2473-991XPublished: New York, NY, USA ACM 31.07.2017Published in 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…”
Get full text
Conference Proceeding -
9
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
ISBN: 1595930612, 9781595930613Published: Washington, DC, USA IEEE Computer Society 2005Published in 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…”
Get full text
Conference Proceeding -
10
Efficient SAT solving: beyond supercubes
ISBN: 1595930582, 9781595930583Published: New York, NY, USA ACM 13.06.2005Published in 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…”
Get full text
Conference Proceeding -
11
Multi-feature and DAG-Based Multi-tree Matching Algorithm for Automatic Web Data Mining
Published: IEEE 01.08.2014Published in 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…”
Get full text
Conference Proceeding -
12
Multi-Agent Patrolling with Reinforcement Learning
ISBN: 9781581138641, 1581138644Published: Washington, DC, USA IEEE Computer Society 19.07.2004Published in 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…”
Get full text
Conference Proceeding -
13
Developing a Deterministic Patrolling Strategy for Security Agents
ISBN: 0769538010, 9780769538013Published: Washington, DC, USA IEEE Computer Society 15.09.2009Published in 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…”
Get full text
Conference Proceeding -
14
An Autonomy-Oriented Paradigm for Self-Organized Computing
ISBN: 0769538010, 9780769538013Published: Washington, DC, USA IEEE Computer Society 2009Published in 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…”
Get full text
Conference Proceeding -
15
A Theoretical Analysis of Multi-Agent Patrolling Strategies
ISBN: 9781581138641, 1581138644Published: Washington, DC, USA IEEE Computer Society 19.07.2004Published in Autonomous Agents and Multiagent Systems: Proceedings, 3rd International Joint Conference, New York City, New York, 2004. (19.07.2004)Get full text
Conference Proceeding -
16
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
ISBN: 0769538010, 9780769538013Published: Washington, DC, USA IEEE Computer Society 15.09.2009Published in 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…”
Get full text
Conference Proceeding -
17
The M2M Pathfinding Algorithm Based on the Idea of Granular Computing
ISBN: 0769538010, 9780769538013Published: Washington, DC, USA IEEE Computer Society 15.09.2009Published in 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…”
Get full text
Conference Proceeding -
18
Code Difference Guided Adversarial Example Generation for Deep Code Models
ISSN: 2643-1572Published: IEEE 11.09.2023Published in 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…”
Get full text
Conference Proceeding -
19
Parallel multiple sequence alignment with local phylogeny search by simulated annealing
ISBN: 1424400546, 9781424400546Published: Washington, DC, USA IEEE Computer Society 25.04.2006Published in 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…”
Get full text
Conference Proceeding -
20
PertNAS: Architectural Perturbations for Memory-Efficient Neural Architecture Search
Published: IEEE 09.07.2023Published in 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…”
Get full text
Conference Proceeding

