Sciweavers

230 search results - page 33 / 46
» Quantum Search with Variable Times
Sort
View
104
Voted
ECAI
2004
Springer
15 years 5 months ago
IPSS: A Hybrid Reasoner for Planning and Scheduling
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
María Dolores Rodríguez-Moreno, Ange...
125
Voted
CP
2005
Springer
15 years 6 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
99
Voted
SAC
2004
ACM
15 years 5 months ago
Axes-based visualizations with radial layouts
In the analysis of multidimensional data sets questions involving detection of extremal events, correlations, patterns and trends play an increasingly important role in a variety ...
Christian Tominski, James Abello, Heidrun Schumann
109
Voted
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
15 years 4 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
113
Voted
CP
2007
Springer
15 years 4 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti