Building something different
Thank you for taking an active part in building
Peer Evaluation’s community of readers, contributors
and reviewers.
Here are 3 ways to spread the word:
You may also copy/paste the message above in an email to your peers.
no
intrusive
behavior
with emails ad
free
working
space no
stickiness,
comfort
cookie only no
monetization
of user
data
intrusive
behavior
with emails ad
free
working
space no
stickiness,
comfort
cookie only no
monetization
of user
data
a community interest project
PROFILE PAGE
Peer Evaluation activity
| Trusted by | 3 |
| Downloads | 6 |
| Views | 110 |
| Followed by | 1 |
Send a 
Toby has...
| Trusted | 0 |
| Reviewed | 0 |
| Emailed | 0 |
| Shared/re-used | 0 |
| Discussed | 0 |
| Invited | 0 |
| Collected | 0 |
Follow
block this user
Toby Walsh Trusted member
Professor
NICTA and UNSW
| Areas(s) | Computer Science |
| Subject(s) | Computer Science |
n/aShares by Toby Walsh
Oh la la
Your session has expired but don’t worry, your message
has been saved.Please log in and we’ll bring you back
to this page. You’ll just need to click “Send”.
Toby's collections (0)
Toby has no collections yet.
Toby's Links on the Web
visiting this person live feed
No peers? Help us spread the word.
in your field
in other fields : Peers you're not following
- FollowPrénom Nom
Affiliation, status, area - FollowPrénom Nom
Affiliation, status, area - FollowPrénom Nom
Affiliation, status, area - FollowPrénom Nom
Affiliation, status, area - FollowPrénom Nom
Affiliation, status, area - FollowPrénom Nom
Affiliation, status, area - FollowPrénom Nom
Affiliation, status, area
You may receive the Trusted member label after :
• Reviewing 10 uploads, whatever the media type.
• Being trusted by 10 peers.
• If you are blocked by 10 peers the "Trust label" will be suspended from your page. We encourage you to contact the administrator to contest the suspension.
Please select an affiliation:
Toby's Peer Evaluation activity
| Trusted by | 3 |
- FLevi Lelis, Student, Ph.D. Level, University of Alberta.
- FMatteo Gagliolo, Post Doctorate, CoMo, VUB, Brussels.
- FPeer Evaluation, Publisher, Peer Evaluation.
| Downloads | 6 |
| Views | 110 |
- 6The Interface between P and NP : COL , XOR , NAE , 1-in-k , and Horn SAT
- 4The Search for Satisfaction 1 Introduction 2 Satis ability
- 4Encodings of Non-Binary Constraint Satisfaction Problems
- 3 The Complexity of Reasoning with Global Constraints
- 3Translation-based Constraint Answer Set Solving
- 3CSPlib: a benchmark library for constraints
- 2A Divergence Critic for Inductive Proof
- 2Scenario-based stochastic constraint programming
- 2Search in a Small World
- 2A Translational Approach to Constraint Answer Set Solving
- 2Manipulation of Nanson ’ s and Baldwin ’ s Rules
- 2Online Cake Cutting
- 2Parameterized Complexity Results in Symmetry Breaking
- 2Propagating Conjunctions of ALLDIFFERENT Constraints
- 2Reformulating Global Grammar Constraints
- 2Automatic Identification of Mathematical Concepts
- 2SAT v CSP
- 2Reformulation of Global Constraints in Answer Set Programming
- 2Decomposition of the NVALUE constraint
- 2Decompositions of Grammar Constraints
- 2Automatic Generation of Implied Clauses for SAT
- 2Backbones and Backdoors in Satisfiability
- 2The Complexity of Global Constraints
- 2Robust Solutions for Constraint Satisfaction and Optimization
- 2Super solutions in constraint programming
- 2Modelling a Balanced Academic Curriculum Problem
- 2Estimating Search Tree Size
- 2Termination Orders for Rippling
- 1 Stochastic Constraint Programming: A Scenario-Based Approach
- 1, Fahiem Bacchus �����
- 13 3 Hybrid Modelling for Robust Solving 4 4
- 1A Calculus for and Termination of Rippling
- 1A Compression Algorithm for Large Arity Extensional Constraints
- 1Finite Domain Constraint Programming Systems
- 1Filtering Algorithms for the NValue Constraint
- 1Backbones and backdoors in satisfiability
- 1Constraints, Satisfiability, and Search
- 1A theory of abstraction
- 1Circuit Complexity and Decompositions of Global Constraints
- 1The Search for Satisfaction 1 Introduction 2 Satis ability
- 1Structure and Randomness
- 1An Empirical Study of the Manipulability of Single Transferable Voting
- 1Aggregating Partially Ordered Preferences
- 1Where are the really hard manipulation problems? The phase transition in manipulating the veto rule
- 1Manipulation and gender neutrality in stable marriage procedures
- 1The Constrainedness of Search
- 1Difference Unification
- 1Symmetry within Solutions
- 1Distance Constraints in Constraint Satisfaction
- 1Global Grammar Constraints
- 1SAT v CSP
- 1Morphing: Combining Structure and Randomness
- 1Easy problems are sometimes hard
- 1A Short Introduction to Preferences: Between Artificial Intelligence and Social Choice
- 1Modelling the Golomb Ruler Problem
- 1Automatic Concept Formation in Pure Mathematics
- 1Beyond NP : the QSAT phase transition
- 1An Empirical Study of Borda Manipulation
- 1Stable Marriage Problems with Quantitative Preferences
- 1Online Estimation of SAT Solving Runtime
- 1Cross-domain Mathematical Concept Formation
- 1The Satisfiability Constraint Gap
- 1Scaling Effects in the CSP Phase Transition
- 1Phase Transitions from Real Computational Problems
- 1The inevitability of inconsistent abstract spaces
- 1Local Consistencies in SAT
- 1Where are the hard manipulation problems?
- 1SCHOOL OF COMPUTER STUDIES Modelling the Golomb Ruler Problem 1 Introduction 2 The problem
- 1Clause Forms Generated by Bounded Model Checking
- 1A Calculus for Rippling
- 1Coloured rippling: An extension of a theorem proving heuristic
| Followed by | 1 |
- FLevi Lelis, Student, Ph.D. Level, University of Alberta.
Toby has...
| Trusted | 0 |
| Reviewed | 0 |
| Emailed | 0 |
| Shared/re-used | 0 |
| Discussed | 0 |
| Invited | 0 |
| Collected | 0 |
To display details, you need to be logged in. Thank You.
To:
© 2010-2012, by ColDev / Collective Developments - ColDev Editions is a member of 
the citation linking backbone.