Sciweavers

2917 search results - page 233 / 584
» Satisfying Interaction Constraints
Sort
View
CASCON
1997
93views Education» more  CASCON 1997»
15 years 8 months ago
Repairing software style using graph grammars
Often, software architects impose a particular style on the software systems they design. For large software systems, they would like to ensure that the design continues to confor...
Hoda Fahmy, Richard C. Holt, Spiros Mancoridis
ACL
1993
15 years 8 months ago
Parsing Free Word Order Languages in the Paninian Framework
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
Akshar Bharati, Rajeev Sangal
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
15 years 7 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
CORR
2010
Springer
152views Education» more  CORR 2010»
15 years 6 months ago
Automatic analysis of distance bounding protocols
Distance bounding protocols are used by nodes in wireless networks for the crucial purpose of estimating their distances to other nodes. Past efforts to analyze these protocols hav...
Sreekanth Malladi, Bezawada Bruhadeshwar, Kishore ...
RTS
2006
84views more  RTS 2006»
15 years 6 months ago
Finite-horizon scheduling of radar dwells with online template construction
Timing constraints for radar tasks are usually specified in terms of the minimum and maximum temporal distance between successive radar dwells. We utilize the idea of feasible int...
Sathish Gopalakrishnan, Marco Caccamo, Chi-Sheng S...