Skip to search formSkip to main contentSkip to account menu

Augmented assignment

Known as: Compound assignment, Augmented assignment operator, %5E= 
Augmented assignment (or compound assignment) is the name given to certain assignment operators in certain programming languages (especially those… 
Wikipedia (opens in a new tab)

Related topics

Related topics

24 relations
ALGOLAWKArray programmingAssignment (computer science)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Distributed Decision and Control for Cooperative UAVs Using Ad Hoc Communication
This study develops a novel distributed algorithm for task assignment (TA), coordination, and communication of multiple unmanned… 
Highly Cited
2005
Highly Cited
2005
Interference-based scheduling in spatial reuse TDMA
Spatial reuse TDMA has been proposed as an access scheme for multi-hop radio networks where real-time service guarantees are… 
2005
2005
A Developmental Approach to the Supervision of Therapists in Training
Supervision is considered essential to therapeutic effectiveness yet trainees frequently report negative supervisory experiences… 
2004
2004
Evidence for Introgression in the Endangered Sonora Tiger Salamander, Ambystoma tigrinum stebbinsi (Lowe)
Abstract Introduction of nonnative species and consequent genetic introgression of native taxa is a primary conservation concern… 
Highly Cited
2003
Highly Cited
2003
Genetic diversity, gene flow and drift in Bavarian red deer populations (Cervus elaphus)
The red deer (Cervus elaphus) populationof Bavaria in Southern Germany was severelyreduced during the 19th century due toover… 
2003
2003
Analysis of task assignment with cycle stealing under central queue
We consider the problem of task assignment in a distributed server system, where short jobs are separated from long jobs, but… 
2002
2002
SOME IDEAS FOR FREEWAY CONGESTION MITIGATION WITH ADVANCED TECHNOLOGIES
This paper presents twelve ideas for improving freeway performance that have become feasible with the advent of advanced… 
1996
1996
How Good Are Branching Rules in DPLL?
1995
1995
Behavioral synthesis of area-efficient testable designs using interaction between hardware sharing and partial scan
We introduce BETS, a behavioral test synthesis system, for the synthesis of high-throughput, area-efficient testable designs… 
Highly Cited
1989
Highly Cited
1989
Optimizing vote and quorum assignments for reading and writing replicated data
The problem is discussed of determining the vote assignment and quorum that yields the highest availability in a system where… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)