作者: 統(tǒng)治人類 時(shí)間: 2025-3-22 00:12
A generalized semantics for concurrent constraint languages and their abstract interpretation,etween constraint systems, which are used to define both concrete and abstract domains. For two constraint systems (., ?) and (.′, ?′), and a concrete program . over constraint system (., ?), we define a corresponding abstract program . over (.′, ?′) such that the execution of . in (.′, ?′) performs作者: 期滿 時(shí)間: 2025-3-22 04:24 作者: depreciate 時(shí)間: 2025-3-22 06:09 作者: Heresy 時(shí)間: 2025-3-22 10:14 作者: 朝圣者 時(shí)間: 2025-3-22 16:07
In search of exceptionally difficult constraint satisfaction problems,r is varied; the peak occurs at the phase transition as problems change from being under-constrained and easy to solve to overconstrained and insoluble. More recently it has been observed that individual problems which are very difficult can be found at some distance from the peak in the median cost作者: 朝圣者 時(shí)間: 2025-3-22 17:51 作者: Colonnade 時(shí)間: 2025-3-22 22:14 作者: 網(wǎng)絡(luò)添麻煩 時(shí)間: 2025-3-23 04:19 作者: CRASS 時(shí)間: 2025-3-23 07:30 作者: floaters 時(shí)間: 2025-3-23 10:30 作者: 真繁榮 時(shí)間: 2025-3-23 16:59
GA-easy and GA-hard constraint satisfaction problems,e greediness of deterministic classical CSP solving techniques can be counterbalanced by the random mechanisms of GAs. We tested our ideas by running experiments on four different CSPs: N-queens, graph 3-colouring, the traffic lights and the Zebra problem. Three of the problems have proven to be GA-作者: 破布 時(shí)間: 2025-3-23 21:44 作者: LIEN 時(shí)間: 2025-3-24 00:36 作者: 分期付款 時(shí)間: 2025-3-24 04:21 作者: Individual 時(shí)間: 2025-3-24 07:28
Numerical Simulation of Wave Propagation of nodes visited, while avoiding redundant consistency checks. This algorithm is further enhanced such that it incorporates conflict-directed backjumping (CBJ) to give FC-BM-CBJ. A series of experiments are then carried out on really hard problems in an attempt to position these new algorithms with respect to the known algorithms.作者: 任意 時(shí)間: 2025-3-24 10:50 作者: commonsense 時(shí)間: 2025-3-24 17:46
Ultrasonic Nondestructive Evaluation Systemspply only to special classes of contraints. However, a specific new algorithm, AC-7, is developed that takes advantage of a simple property common to all binary constraints to eliminate constraint checks that other arc consistency algorithms perform.作者: NAVEN 時(shí)間: 2025-3-24 22:58 作者: escalate 時(shí)間: 2025-3-24 23:54 作者: 背書 時(shí)間: 2025-3-25 07:15
Emanuele Fabbro,Alessandro Mudaficient. In this paper, we present an efficient high-level constraint mechanism. High-level constraints are ordinary predicates with an additional constraint declaration. They offer fine-grained control over the tradeoff between pruning power and execution time and achieve huge speedups over lookahead declarations.作者: 職業(yè)拳擊手 時(shí)間: 2025-3-25 10:27
,Uranium Boom in Namibia – Hausse or Baisse,formed. Therefore, it is essential that the final result does not depend on which action is chosen (i.e., on the adopted computation rule). We show that this property holds in CHIP(FD), as long as the computation rule satisfies some reasonable conditions.作者: 滴注 時(shí)間: 2025-3-25 15:08 作者: Keratectomy 時(shí)間: 2025-3-25 18:58 作者: affinity 時(shí)間: 2025-3-25 20:32 作者: plasma 時(shí)間: 2025-3-26 02:06 作者: Deject 時(shí)間: 2025-3-26 07:25
Still Pretty Hot for a Fading Old Star!,means of a reexecution algorithm, extending thus a previous framework for abstract interpretation of concurrent logic languages. We also show how suspension analysis can be performed within this framework.作者: HAVOC 時(shí)間: 2025-3-26 10:44
Ultrasonic Nondestructive Evaluation Systemstechniques which remove other kinds of redundancy (tuple redundancy, such as the local consistency algorithms, or also constraint redundancy), can be very helpful for constraint solving. In fact, the number of variables coincide with the depth of the search tree. Therefore removing variables means shortening the search tree itself.作者: intangibility 時(shí)間: 2025-3-26 15:46
A generalized semantics for concurrent constraint languages and their abstract interpretation,means of a reexecution algorithm, extending thus a previous framework for abstract interpretation of concurrent logic languages. We also show how suspension analysis can be performed within this framework.作者: 小口啜飲 時(shí)間: 2025-3-26 19:15 作者: 血友病 時(shí)間: 2025-3-26 21:23
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/235927.jpg作者: Gum-Disease 時(shí)間: 2025-3-27 04:34 作者: 憤怒事實(shí) 時(shí)間: 2025-3-27 05:33
Still Pretty Hot for a Fading Old Star!,etween constraint systems, which are used to define both concrete and abstract domains. For two constraint systems (., ?) and (.′, ?′), and a concrete program . over constraint system (., ?), we define a corresponding abstract program . over (.′, ?′) such that the execution of . in (.′, ?′) performs作者: 看法等 時(shí)間: 2025-3-27 09:38
Emanuele Fabbro,Alessandro Mudaproblems, the built-in constraints often do not suffice. Unfortunately, new constraints defined with lookahead and forward declarations are often inefficient. In this paper, we present an efficient high-level constraint mechanism. High-level constraints are ordinary predicates with an additional con作者: 收集 時(shí)間: 2025-3-27 13:58
Riccardo Sartoris,Alessandro Mudaounts of knowledge. They also offer powerful reasoning mechanisms (classification, inheritance, methods, etc.) which, applied on the current facts of a knowledge base, will deduce implicit or hypothetical facts and then increase the amount of knowledge..Fully integrating constraints into an object-b作者: 胡言亂語(yǔ) 時(shí)間: 2025-3-27 21:22
Ultrasound Anatomy of Lower Limb Muscles4000 students of various branches of instruction have to attend examination during a couple of weeks for academic reasons. The problem (for June 1993) consists of planning 308 different examinations on 33 half-days over 7 rooms of different capacities. A set of different and various constraints has 作者: 羊齒 時(shí)間: 2025-3-27 22:21
Ultrasonic Nondestructive Evaluation Systemsr is varied; the peak occurs at the phase transition as problems change from being under-constrained and easy to solve to overconstrained and insoluble. More recently it has been observed that individual problems which are very difficult can be found at some distance from the peak in the median cost作者: 斜谷 時(shí)間: 2025-3-28 04:12
Ultrasonic Nondestructive Evaluation Systemsthat specify which combinations of values are consistent. Knowledge about properties of the constraints can permit inferences that reduce the cost of consistency checking. Specifically, such inferences can be used to reduce the number of constraint checks required in establishing arc consistency, a 作者: 維持 時(shí)間: 2025-3-28 07:23
Numerical Simulation of Wave Propagationems, leading to a reduction in nodes visited, which tends to result in reduced search effort. In contrast, Gaschnig‘s backmarking routine (BM) attempts to avoid performing redundant consistency checks. These two algorithms are combined to give FC-BM, an algorithm that attempts to minimise the number作者: Little 時(shí)間: 2025-3-28 10:48
Ultrasonic Nondestructive Evaluation Systems a subset of the variables are chosen to be “visible”, and the others are therefore “hidden”. Visible variables are the variables of interest from the outside, in the sense that a solution involves only them. For variable redundancy we mean that the elimination of a variable, together with all the c作者: LAIR 時(shí)間: 2025-3-28 15:55
,Uranium Boom in Namibia – Hausse or Baisse, handled by means of the arc-consistency and the sup-inf procedures..At each point of the computation of a CHIP(FD) program several actions can be performed. Therefore, it is essential that the final result does not depend on which action is chosen (i.e., on the adopted computation rule). We show th作者: Venules 時(shí)間: 2025-3-28 19:42
https://doi.org/10.1007/978-3-319-11152-0 solve a combinatorial search problem: checking the consistency of disjunctive constraint sets..In the second part we give a qualitative model allowing us to predict the usefulness of the combined method on the average case, comparing it with forward checking.作者: 凹槽 時(shí)間: 2025-3-29 01:12 作者: Collar 時(shí)間: 2025-3-29 03:59
Combining hill climbing and forward checking for handling disjunctive constraints, solve a combinatorial search problem: checking the consistency of disjunctive constraint sets..In the second part we give a qualitative model allowing us to predict the usefulness of the combined method on the average case, comparing it with forward checking.作者: placebo 時(shí)間: 2025-3-29 09:29
https://doi.org/10.1007/3-540-59479-5Artificial intelligence; European Conference on Artificial Intelligence; expert system; intelligence; kn作者: ferment 時(shí)間: 2025-3-29 15:09 作者: 禍害隱伏 時(shí)間: 2025-3-29 18:14 作者: 懶惰人民 時(shí)間: 2025-3-29 23:16
https://doi.org/10.1007/978-3-319-11152-0 solve a combinatorial search problem: checking the consistency of disjunctive constraint sets..In the second part we give a qualitative model allowing us to predict the usefulness of the combined method on the average case, comparing it with forward checking.作者: 松果 時(shí)間: 2025-3-29 23:58 作者: 生存環(huán)境 時(shí)間: 2025-3-30 05:27
Riccardo Sartoris,Alessandro Mudascribe the main features of the system before detailing the different kinds of constraints available in .. Constraint maintenance in . is delegated to a constraint programming library through an interface we also present here. Constraint propagation serves as an inference mechanism for inferring mis作者: HEW 時(shí)間: 2025-3-30 11:29
Ultrasound Anatomy of Lower Limb Musclesnstraints like the cumulative constraint. After having described the specific problem of our university, we will present the two developments and compare them. Finally, we will illustrate the huge capacity of prototyping and implementation of real-life applications in Constraint Logic Programming.作者: 雪白 時(shí)間: 2025-3-30 12:46
Ultrasonic Nondestructive Evaluation Systemss . inherently more difficult than other similar problems and that an important factor is the diversity in the set of solutions to the problem. Exceptionally difficult problems can also occur if the search space induced by the search algorithm is unusually large. The existence of occasional very dif
