Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[ספר][B] Handbook of constraint programming
F Rossi, P Van Beek, T Walsh - 2006 - books.google.com
Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …
that draws on a wide range of techniques from artificial intelligence, computer science …
[PDF][PDF] The valorization of surveillance: Towards a political economy of Facebook
Much excitement surrounds Facebook, the social networking site based on user-generated
content that has attracted 64 million active users since its inception in 2004. This paper …
content that has attracted 64 million active users since its inception in 2004. This paper …
[ספר][B] Qualitative spatial and temporal reasoning
G Ligozat - 2013 - books.google.com
Starting with an updated description of Allen's calculus, the book proceeds with a description
of the main qualitative calculi which have been developed over the last two decades. It …
of the main qualitative calculi which have been developed over the last two decades. It …
Scaling and probabilistic smoothing: Efficient dynamic local search for SAT
In this paper, we study the approach of dynamic local search for the SAT problem. We focus
on the recent and promising Exponentiated Sub-Gradient (ESG) algorithm, and examine the …
on the recent and promising Exponentiated Sub-Gradient (ESG) algorithm, and examine the …
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem
defined by a network of local cost functions defined over discrete variables. It has …
defined by a network of local cost functions defined over discrete variables. It has …
Optimization of temporal dynamics for adaptive human-robot interaction in assembly manufacturing
Human-robot collaboration presents an opportunity to improve the efficiency of
manufacturing and assembly processes, particularly for aerospace manufacturing where …
manufacturing and assembly processes, particularly for aerospace manufacturing where …
Soft constraints
Publisher Summary This chapter examines that several real-life combinatorial problems can
be naturally modelled and often efficiently solved using constraint techniques. It is …
be naturally modelled and often efficiently solved using constraint techniques. It is …
[ספר][B] A Short introduction to preferences: between AI and social choice
F Rossi, KB Venable, T Walsh - 2011 - books.google.com
Computational social choice is an expanding field that merges classical topics like
economics and voting theory with more modern topics like artificial intelligence, multiagent …
economics and voting theory with more modern topics like artificial intelligence, multiagent …
Optimal rectangle packing
We consider the NP-complete problem of finding an enclosing rectangle of minimum area
that will contain a given a set of rectangles. We present two different constraint-satisfaction …
that will contain a given a set of rectangles. We present two different constraint-satisfaction …
[PDF][PDF] Self-adapting large neighborhood search: Application to single-mode scheduling problems
Providing robust scheduling algorithms that can solve a large variety of scheduling problems
with good performance is one of the biggest challenge of practical schedulers today. In this …
with good performance is one of the biggest challenge of practical schedulers today. In this …